Result 1 to 20 of 39 total
Augmenting the connectivity of planar and geometric graphs. (English)
J. Graph Algorithms Appl. 16, No. 2, 599-628 (2012).
1
An algorithmic study of switch graphs. (English)
Acta Inf. 49, No. 5, 295-312 (2012).
2
On the complexity of partitioning graphs for arc-flags. (English)
Delling, Daniel (ed.) et al., 12th workshop on algorithmic approaches for transportation modelling, optimization, and systems, ATMOS’12, September 13, 2012, Ljubljana, Slovenia. Selected papers based on the presentations at the workshop. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-45-3). OASIcs ‒ OpenAccess Series in Informatics 25, 71-82, electronic only (2012).
3
On the complexity of partitioning graphs for arc-flags. (English)
Simões, Alberto (ed.) et al., 1st symposium on languages, applications and technologies, SLATE’12, June 21‒22, 2012, Braga, Portugal. Proceedings. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-40-8). OASIcs ‒ OpenAccess Series in Informatics 21, 71-82, electronic only (2012).
4
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. (English)
J. Discrete Algorithms 14, 150-172 (2012).
5
Generalizing geometric graphs. (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, 179-190 (2012).
6
Hamiltonian orthogeodesic alternating paths. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20‒22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 170-181 (2011).
7
The density maximization problem in graphs. (English)
Fu, Bin (ed.) et al., Computing and combinatorics. 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22684-7/pbk). Lecture Notes in Computer Science 6842, 25-36 (2011).
8
Consistent labeling of rotating maps. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 451-462 (2011).
9
Computing large matchings in planar graphs with fixed minimum degree. (English)
Theor. Comput. Sci. 412, No. 32, 4092-4099 (2011).
10
Consistent labeling of rotating maps. (English)
Comput. Res. Repos. 2011, Article No. 1104.5634 (2011).
11
Speed dating. An algorithmic case study involving matching and scheduling. (English)
Pardalos, Panos M. (ed.) et al., Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20661-0/pbk). Lecture Notes in Computer Science 6630, 292-303 (2011).
12
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 212-225 (2011).
13
On $d$-regular schematization of embedded paths. (English)
Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22‒28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 260-271 (2011).
14
Automatic generation of route sketches. (English)
Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21‒24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 391-392 (2011).
15
Orthogonal graph drawing with flexibility constraints. (English)
Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21‒24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 92-104 (2011).
16
A Kuratowski-type theorem for planarity of partially embedded graphs (English)
Symposium on Computational Geometry, 107-116 (2011).
17
Speed dating - an algorithmic case study involving matching and scheduling (English)
SEA, 292-303 (2011).
18
Consistent labeling of rotating maps (English)
WADS, 451-462 (2011).
19
The density maximization problem in graphs (English)
COCOON, 25-36 (2011).
20
Result 1 to 20 of 39 total
Start
Contact
Print
General Help
