Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND YEAR=2014

• Height-preserving transformations of planar graph drawings
  Therese Biedl
  Lecture Notes in Computer Science 8871, 2014, pp. 380-391
• Drawing planar graphs with reduced height
  Stephane Durocher, Debajyoti Mondal
  Lecture Notes in Computer Science 8871, 2014, pp. 392-403
• Anchored drawings of planar graphs
  Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli
  Lecture Notes in Computer Science 8871, 2014, pp. 404-415
• Advances on testing c-planarity of embedded flat clustered graphs
  Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein
  Lecture Notes in Computer Science 8871, 2014, pp. 416-427
• Clustered planarity testing revisited
  Radoslav Fulek, Jan Kync̑l, Igor Malinović, Dömötör Pálvölgyi
  Lecture Notes in Computer Science 8871, 2014, pp. 428-439
• A new perspective on clustered planarity as a combinatorial embedding problem
  Thomas Bläsius, Ignaz Rutter
  Lecture Notes in Computer Science 8871, 2014, pp. 440-451
• MapSets: Visualizing embedded and clustered graphs
  Alon Efrat, Yifan Hu, Stephen G. Kobourov, Sergey Pupyrev
  Lecture Notes in Computer Science 8871, 2014, pp. 452-463
• Increasing-chord graphs on point sets
  Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson
  Lecture Notes in Computer Science 8871, 2014, pp. 464-475
• Unifying duality theorems for width parameters in graphs and matroids
  Reinhard Diestel, Sang-il Oum
  Lecture Notes in Computer Science 8747, 2014, pp. 1-14
• Distributedly testing cycle-freeness
  Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu
  Lecture Notes in Computer Science 8747, 2014, pp. 15-28
• DMVP: Foremost waypoint coverage of time-varying graphs
  Eric Aaron, Danny Krizanc, Elliot Meyerson
  Lecture Notes in Computer Science 8747, 2014, pp. 29-41
• Linear rank-width of distance-hereditary graphs
  Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
  Lecture Notes in Computer Science 8747, 2014, pp. 42-55
• Vertex contact graphs of paths on a grid
  Nieke Aerts, Stefan Felsner
  Lecture Notes in Computer Science 8747, 2014, pp. 56-68
• Deciding the bell number for hereditary graph properties
  Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin
  Lecture Notes in Computer Science 8747, 2014, pp. 69-80
• Boxicity and separation dimension
  Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
  Lecture Notes in Computer Science 8747, 2014, pp. 81-92
• Maximal induced matchings in triangle-free graphs
  Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
  Lecture Notes in Computer Science 8747, 2014, pp. 93-104
• Independent set reconfiguration in cographs
  Paul Bonsma
  Lecture Notes in Computer Science 8747, 2014, pp. 105-116
• Structural parameterizations for boxicity
  Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
  Lecture Notes in Computer Science 8747, 2014, pp. 117-128
• A new characterization of P_k-free graphs
  Eglantine Camby, Oliver Schaudt
  Lecture Notes in Computer Science 8747, 2014, pp. 129-138
• Contact representations of planar graphs: Extending a partial representation is hard
  Steven Chaplick, Paul Dorbec, Jan Kratochvíl, Mickael Montassier, Juraj Stacho
  Lecture Notes in Computer Science 8747, 2014, pp. 139-151
• The maximum labeled path problem
  Basile Couëtoux, Elie Nakache, Yann Vax`es
  Lecture Notes in Computer Science 8747, 2014, pp. 152-163
• Minimum spanning tree verification under uncertainty
  Thomas Erlebach, Michael Hoffmann
  Lecture Notes in Computer Science 8747, 2014, pp. 164-175
• Towards the Hanani-Tutte theorem for clustered graphs
  Radoslav Fulek
  Lecture Notes in Computer Science 8747, 2014, pp. 176-188
• On set expansion problems and the small set expansion conjecture
  Rajiv Gandhi, Guy Kortsarz
  Lecture Notes in Computer Science 8747, 2014, pp. 189-200
• Losing weight by gaining edges
  Amir Abboud, Kevin Lewi, Ryan Williams
  Lecture Notes in Computer Science 8737, 2014, pp. 1-12