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

• 2024
• 
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali:
  On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. Algorithmica 86(10): 3231-3251 (2024)
• 
  Giacomo Ortali, Ioannis G. Tollis:
  A fixed-parameter algorithm for dominance drawings of DAGs. Theor. Comput. Sci. 1020: 114819 (2024)
• 
  Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
  Partial Temporal Vertex Cover with Bounded Activity Intervals. SAND 2024: 11:1-11:14
• 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)
• 
  Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
  Small Point-Sets Supporting Graph Stories. J. Graph Algorithms Appl. 27(8): 651-677 (2023)
• 
  Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
  Rectilinear Planarity of Partial 2-Trees. J. Graph Algorithms Appl. 27(8): 679-719 (2023)
• 
  Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
  On the parameterized complexity of s-club cluster deletion problems. Theor. Comput. Sci. 969: 114041 (2023)
• 
  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
• 
  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
• 
  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
• 
  Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
  On the Parameterized Complexity of s-club Cluster Deletion Problems. SOFSEM 2023: 159-173
• 
  Giacomo Ortali, Ioannis G. Tollis:
  Dominance Drawings for DAGs with Bounded Modular Width. SOFSEM 2023: 65-79
• 
  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)
• 
  Walter Didimo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali:
  On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. CoRR abs/2308.13665 (2023)
• 2022
• 
  Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
  Small Point-Sets Supporting Graph Stories. GD 2022: 289-303
• 
  Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
  Rectilinear Planarity of Partial 2-Trees. GD 2022: 157-172
• 
  Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
  On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem. ICTCS 2022: 14-20
• 
  Giacomo Ortali, Ioannis G. Tollis:
  Computing Weak Dominance Drawings with Minimum Number of Fips. CoRR abs/2201.10201 (2022)
• 
  Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
  Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. CoRR abs/2205.07500 (2022)
• 
  Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
  On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem. CoRR abs/2205.10834 (2022)
• 
  Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
  Rectilinear Planarity of Partial 2-Trees. CoRR abs/2208.12558 (2022)
• 
  Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
  Small Point-Sets Supporting Graph Stories. CoRR abs/2208.14126 (2022)
• 2021
• 
  Panagiotis Lionakis, Giacomo Ortali, Ioannis G. Tollis:
  Constant-Time Reachability in DAGs Using Multidimensional Dominance Drawings. SN Comput. Sci. 2(4): 320 (2021)
• 
  Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
  Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs. CoRR abs/2110.00548 (2021)
• 2020
• 
  Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
  Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. GD 2020: 436-449
• 
  Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
  Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. SODA 2020: 806-825
• 
  Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
  Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. CoRR abs/2008.03784 (2020)
• 2019
• 
  Giacomo Ortali, Ioannis G. Tollis:
  A New Framework for Hierarchical Drawings. J. Graph Algorithms Appl. 23(3): 553-578 (2019)
• 
  Giacomo Ortali, Ioannis G. Tollis:
  Multidimensional Dominance Drawings. CoRR abs/1906.09224 (2019)

skipping 4 more matches