Result 1 to 20 of 181 total
Drawing Hamiltonian cycles with no large angles. (English)
Electron. J. Comb. 19, No. 2, Research Paper P31, 13 p., electronic only (2012).
1
Monotone crossing number. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 278-289 (2012).
2
io-port 50096879 Tóth, Gábor;
Van Der Holst, Bart;
Sokolov, Igor V.;
De Zeeuw, Darren;
Gombosi, Tamas I.;
Fang, Fang;
Manchester, Ward B.;
Meng, Xing;
Najib, Dalal;
Powell, Kenneth G.;
Stout, Quentin F.;
Glocer, Alex;
Ma, Ying-Juan;
Opher, Merav
Adaptive numerical algorithms in space weather modeling (English)
J. Comput. Physics 231, No. 3, 870-903 (2012).
3
Graph unique-maximum and conflict-free colorings. (English)
J. Discrete Algorithms 9, No. 3, 241-251 (2011).
4
Adding process metrics to enhance modification complexity prediction (English)
ICPC, 201-204 (2011).
5
Monotone crossing number (English)
Graph Drawing, 278-289 (2011).
6
Disjoint edges in topological graphs. (English)
J. Comb. 1, No. 3-4, 335-344 (2010).
7
Towards the Albertson conjecture. (English)
Electron. J. Comb. 17, No. 1, Research Paper R73, 15 p. (2010).
8
Graph unique-maximum and conflict-free colorings. (English)
Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 7th international conference, CIAC 2010, Rome, Italy, May 26‒28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13072-4/pbk). Lecture Notes in Computer Science 6078, 143-154 (2010).
9
Drawing Hamiltonian cycles with no large angles. (English)
Eppstein, David (ed.) et al., Graph drawing. 17th international symposium, GD 2009, Chicago, IL, USA, September 22‒25, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11804-3/pbk). Lecture Notes in Computer Science 5849, 3-14 (2010).
10
Cubic graphs have bounded slope parameter. (English)
J. Graph Algorithms Appl. 14, No. 1, 5-17 (2010).
11
Convex polygons are cover-decomposable (English)
Discrete & Computational Geometry 43, No. 3, 483-496 (2010).
12
Protection system against overload and distributed denial of service attacks (English)
IJCCBS 1, No. 1-3, 148-160 (2010).
13
Complex event processing synergies with predictive analytics (English)
DEBS, 95-96 (2010).
14
Comparison of different impact analysis methods and programmer’s opinion: an empirical study (English)
PPPJ, 109-118 (2010).
15
CIASYS‒change impact analysis at system level (English)
CSMR, 198-201 (2010).
16
Graph unique-maximum and conflict-free colorings (English)
CIAC, 143-154 (2010).
17
Graph unique-maximum and conflict-free colorings. (English)
Comput. Res. Repos. 2009, Article No. 0912.3004 (2009).
18
On the structure of convex sets with symmetries. (English)
Geom. Dedicata 143, 69-80 (2009).
19
Reform of the software engineering teaching ‒ demands and conception. (English)
Kovács, Emőd (ed.) et al., Proceedings of the 7th international conference on applied informatics (ICAI 2007), January 28‒31, 2007, Eger, Hungary. Vol. II. Eger: Eszterházy Károly College. 63-70 (2009).
20
Result 1 to 20 of 181 total
Start
Contact
Print
General Help
