• 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 434 matches

• 2024
• 
  Carla Binucci, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
  Graphs Drawn With Some Vertices per Face: Density and Relationships. IEEE Access 12: 68828-68846 (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)
• 
  Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis:
  On the complexity of the storyplan problem. J. Comput. Syst. Sci. 139: 103466 (2024)
• 
  Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
  Min-k-planar Drawings of Graphs. J. Graph Algorithms Appl. 28(2): 1-35 (2024)
• 
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
  Comparative Study and Evaluation of Hybrid Visualizations of Graphs. IEEE Trans. Vis. Comput. Graph. 30(7): 3503-3515 (2024)
• 
  Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink:
  Outerplanar and Forest Storyplans. SOFSEM 2024: 211-225
• 2023
• 
  Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
  Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. Algorithmica 85(9): 2605-2666 (2023)
• 
  William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat:
  Drawing Partial 2-Trees with Few Slopes. Algorithmica 85(5): 1156-1175 (2023)
• 
  Lorenzo Ariemma, Alessandro Dell'Orco, Simone Liotta, Massimo Candela, Giuseppe Di Battista:
  Long-lasting sequences of BGP updates. Comput. Networks 220: 109481 (2023)
• 
  Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini:
  k-Planar Placement and Packing of Δ-Regular Caterpillars. Int. J. Found. Comput. Sci. 34(7): 875-902 (2023)
• 
  Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
  Parameterized complexity of graph planarity with restricted cyclic orders. J. Comput. Syst. Sci. 135: 125-144 (2023)
• 
  Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
  Rectilinear Planarity of Partial 2-Trees. J. Graph Algorithms Appl. 27(8): 679-719 (2023)
• 
  William J. Lenhart, Giuseppe Liotta:
  Mutual witness Gabriel drawings of complete bipartite graphs. Theor. Comput. Sci. 974: 114115 (2023)
• 
  Emilio Di Giacomo, Beniamino Di Martino, Walter Didimo, Antonio Esposito, Giuseppe Liotta, Fabrizio Montecchiani:
  Design of a Process and a Container-Based Cloud Architecture for the Automatic Generation of Storyline Visualizations. AINA (3) 2023: 90-99
• 
  Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
  Min-k-planar Drawings of Graphs. GD (1) 2023: 39-52
• 
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali:
  On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. GD (2) 2023: 53-65
• 
  Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta:
  Mutual Witness Proximity Drawings of Isomorphic Trees. GD (1) 2023: 304-319
• 
  Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
  Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. GD (2) 2023: 203-217
• 
  Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
  Three Edge-Disjoint Plane Spanning Paths in a Point Set. GD (1) 2023: 323-338
• 
  Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli:
  On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper). ICTCS 2023: 98-103
• 
  Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
  Rectilinear-Upward Planarity Testing of Digraphs. ISAAC 2023: 26:1-26:20
• 
  Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
  The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. ISAAC 2023: 46:1-46:13
• 
  Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli:
  On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. MFCS 2023: 18:1-18:15
• 
  Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
  Parameterized Approaches to Orthogonal Compaction. SOFSEM 2023: 111-125
• 
  Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
  Nonplanar Graph Drawings with k Vertices per Face. WG 2023: 86-100
• 
  Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta:
  WALCOM: Algorithms and Computation - 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings. Lecture Notes in Computer Science 13973, Springer 2023, ISBN 978-3-031-27050-5 [contents]
• 
  Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini:
  k-planar Placement and Packing of Δ-regular Caterpillars. CoRR abs/2301.01226 (2023)
• 
  Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli:
  On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. CoRR abs/2306.03196 (2023)
• 
  Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
  Three Edge-disjoint Plane Spanning Paths in a Point Set. CoRR abs/2306.07237 (2023)
• 
  Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
  Min-k-planar Drawings of Graphs. CoRR abs/2308.13401 (2023)

skipping 404 more matches