• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 141 matches

• 2024
• 
  Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
  Recognizing Map Graphs of Bounded Treewidth. Algorithmica 86(2): 613-637 (2024)
• 
  Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
  Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. Algorithmica 86(8): 2413-2447 (2024)
• 
  Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck:
  2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth. Comput. J. 67(3): 1005-1016 (2024)
• 
  Michael A. Bekos, Giordano Da Lozzo, Svenja M. Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou:
  Book embeddings of k-framed graphs and k-map graphs. Discret. Math. 347(1): 113690 (2024)
• 
  Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
  Testing the planar straight-line realizability of 2-trees with prescribed edge lengths. Eur. J. Comb. 119: 103806 (2024)
• 
  Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
  Quantum Graph Drawing. WALCOM 2024: 32-46
• 
  Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
  Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. WALCOM 2024: 350-364
• 2023
• 
  Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
  Upward Book Embeddability of st-Graphs: Complexity and Algorithms. Algorithmica 85(12): 3521-3571 (2023)
• 
  Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
  Planar L-Drawings of Directed Graphs. Comput. Geom. Topol. 2(1): 7:1-7:15 (2023)
• 
  Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
  Morphing Triangle Contact Representations of Triangulations. Discret. Comput. Geom. 70(3): 991-1024 (2023)
• 
  Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
  On the upward book thickness problem: Combinatorial and complexity results. Eur. J. Comb. 110: 103662 (2023)
• 
  Giordano Da Lozzo, Philipp Kindermann:
  Guest Editors' Foreword. J. Graph Algorithms Appl. 27(6): 405-408 (2023)
• 
  Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
  Recognizing DAGs with page-number 2 is NP-complete. Theor. Comput. Sci. 946: 113689 (2023)
• 
  Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff:
  The Parametrized Complexity of the Segment Number. GD (2) 2023: 97-113
• 
  Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
  Quantum Graph Drawing. CoRR abs/2307.08371 (2023)
• 
  Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff:
  The Parametrized Complexity of the Segment Number. CoRR abs/2308.15416 (2023)
• 
  Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
  Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. CoRR abs/2310.02247 (2023)
• 2022
• 
  Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
  How to Morph a Tree on a Small Grid. Discret. Comput. Geom. 67(3): 743-786 (2022)
• 
  Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
  Planar L-Drawings of Bimodal Graphs. J. Graph Algorithms Appl. 26(3): 307-334 (2022)
• 
  Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
  Unit-length Rectangular Drawings of Graphs. GD 2022: 127-143
• 
  Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
  Recognizing DAGs with Page-Number 2 Is NP-complete. GD 2022: 361-370
• 
  Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann:
  Graph Product Structure for h-Framed Graphs. ISAAC 2022: 23:1-23:15
• 
  Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
  On Upward-Planar L-Drawings of Graphs. MFCS 2022: 10:1-10:15
• 
  Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
  Recognizing Map Graphs of Bounded Treewidth. SWAT 2022: 8:1-8:18
• 
  Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann:
  Graph Product Structure for h-Framed Graphs. CoRR abs/2204.11495 (2022)
• 
  Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
  On Upward-Planar L-Drawings of Graphs. CoRR abs/2205.05627 (2022)
• 
  Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
  Recognizing Map Graphs of Bounded Treewidth. CoRR abs/2206.14898 (2022)
• 
  Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
  Recognizing DAGs with Page-Number 2 is NP-complete. CoRR abs/2208.13615 (2022)
• 
  Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
  Unit-length Rectangular Drawings of Graphs. CoRR abs/2208.14142 (2022)
• 2021
• 
  Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
  C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. Algorithmica 83(8): 2471-2502 (2021)

skipping 111 more matches