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=2013

• Straight-line grid drawings of 3-connected 1-planar graphs
  Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov
  Lecture Notes in Computer Science 8242, 2013, pp. 83-94
• Recognizing outer 1-planar graphs in linear time
  Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
  Lecture Notes in Computer Science 8242, 2013, pp. 107-118
• Straight line triangle representations
  Nieke Aerts, Stefan Felsner
  Lecture Notes in Computer Science 8242, 2013, pp. 119-130
• Extending partial representations of circle graphs
  Steven Chaplick, Radoslav Fulek, Pavel Klavík
  Lecture Notes in Computer Science 8242, 2013, pp. 131-142
• Superpatterns and universal point sets
  Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein
  Lecture Notes in Computer Science 8242, 2013, pp. 208-219
• Simultaneous embedding: Edge orderings, relative positions, cutvertices
  Thomas Bläsius, Annette Karrer, Ignaz Rutter
  Lecture Notes in Computer Science 8242, 2013, pp. 220-231
• Many-to-one boundary labeling with backbones
  Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis
  Lecture Notes in Computer Science 8242, 2013, pp. 244-255
• Drawing non-planar graphs with crossing-free subgraphs
  Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis
  Lecture Notes in Computer Science 8242, 2013, pp. 292-303
• Exploring complex drawings via edge stratification
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ioannis G. Tollis
  Lecture Notes in Computer Science 8242, 2013, pp. 304-315
• Fixed parameter tractability of crossing minimization of almost-trees
  Michael J. Bannister, David Eppstein, Joseph A. Simons
  Lecture Notes in Computer Science 8242, 2013, pp. 340-351
• Minimum length embedding of planar graphs at fixed vertex locations
  Timothy M. Chan, Hella-Franziska Hoffmann, Stephen Kiazyk, Anna Lubiw
  Lecture Notes in Computer Science 8242, 2013, pp. 376-387
• On orthogonally convex drawings of plane graphs
  Yi-Jun Chang, Hsu-Chun Yen
  Lecture Notes in Computer Science 8242, 2013, pp. 400-411
• Slanted orthogonal drawings
  Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Näher, Vincenzo Roselli
  Lecture Notes in Computer Science 8242, 2013, pp. 424-435
• Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
  Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
  Lecture Notes in Computer Science 8242, 2013, pp. 460-471
• Drawing permutations with few corners
  Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev
  Lecture Notes in Computer Science 8242, 2013, pp. 484-495
• Dynamic traceroute visualization at multiple abstraction levels
  Massimo Candela, Marco Di Bartolomeo, Giuseppe Di Battista, Claudio Squarcella
  Lecture Notes in Computer Science 8242, 2013, pp. 496-507
• Robustness in timed automata
  Patricia Bouyer, Nicolas Markey, Ocan Sankur
  Lecture Notes in Computer Science 8169, 2013, pp. 1-18
• Reachability problems for hierarchical piecewise constant derivative systems
  Paul C. Bell, Shang Chen
  Lecture Notes in Computer Science 8169, 2013, pp. 46-58
• Parametric interrupt timed automata
  Beatrice Bérard, Serge Haddad, Aleksandra Jovanović, Didier Lime
  Lecture Notes in Computer Science 8169, 2013, pp. 59-69
• Deciding continuous-time metric temporal logic with counting modalities
  Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
  Lecture Notes in Computer Science 8169, 2013, pp. 70-82
• MaRDiGraS: Simplified building of reachability graphs on large clusters
  Carlo Bellettini, Matteo Camilli, Lorenzo Capra, Mattia Monga
  Lecture Notes in Computer Science 8169, 2013, pp. 83-95
• Modular synthesis with open components
  Ilaria De Crescenzo, Salvatore La Torre
  Lecture Notes in Computer Science 8169, 2013, pp. 96-108
• Parameterized verification of broadcast networks of register automata
  Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso
  Lecture Notes in Computer Science 8169, 2013, pp. 109-121
• Linear rank-width and linear clique-width of trees
  Isolde Adler, Mamadou Moustapha Kanté
  Lecture Notes in Computer Science 8165, 2013, pp. 12-25
• Threshold-coloring and unit-cube contact representation of graphs
  Md. Jawaherul Alam, Steven Chaplick, Gas̑per Fijavz̑, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev
  Lecture Notes in Computer Science 8165, 2013, pp. 26-37