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

• 2024
• 
  Giorgos Kritikakis, Ioannis G. Tollis:
  Parameterized Linear Time Transitive Closure. CoRR abs/2404.17954 (2024)
• 2023
• 
  Panagiotis Lionakis, Giorgos Kritikakis, Ioannis G. Tollis:
  Experiments and a User Study for Hierarchical Drawings of Graphs. IEEE Access 11: 55618-55629 (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)
• 
  Vasileios Geladaris, Panagiotis Lionakis, Ioannis G. Tollis:
  Effective Computation of a Feedback Arc Set Using PageRank. J. Graph Algorithms Appl. 27(8): 737-757 (2023)
• 
  Giacomo Ortali, Ioannis G. Tollis:
  Dominance Drawings for DAGs with Bounded Modular Width. SOFSEM 2023: 65-79
• 
  Giorgos Kritikakis, Ioannis G. Tollis:
  Fast Reachability Using DAG Decomposition. SEA 2023: 2:1-2:17
• 2022
• 
  Vasileios Geladaris, Panagiotis Lionakis, Ioannis G. Tollis:
  Computing a Feedback Arc Set Using PageRank. GD 2022: 188-200
• 
  Giacomo Ortali, Ioannis G. Tollis:
  Computing Weak Dominance Drawings with Minimum Number of Fips. CoRR abs/2201.10201 (2022)
• 
  Vasileios Geladaris, Panagiotis Lionakis, Ioannis G. Tollis:
  Computing a Feedback Arc Set Using PageRank. CoRR abs/2208.09234 (2022)
• 
  Panagiotis Lionakis, Giorgos Kritikakis, Ioannis G. Tollis:
  Experiments and a User Study for Hierarchical Drawings of Graphs. CoRR abs/2209.04522 (2022)
• 
  Giorgos Kritikakis, Ioannis G. Tollis:
  Fast and Practical DAG Decomposition with Reachability Applications. CoRR abs/2212.03945 (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)
• 2020
• 
  Ioannis G. Tollis, Konstantinos G. Kakoulis:
  Algorithms for visualizing phylogenetic networks. Theor. Comput. Sci. 835: 31-43 (2020)
• 
  Panagiotis Lionakis, Giorgos Kritikakis, Ioannis G. Tollis:
  Algorithms and Experiments Comparing Two Hierarchical Drawing Frameworks. CoRR abs/2011.12155 (2020)
• 2019
• 
  Giacomo Ortali, Ioannis G. Tollis:
  A New Framework for Hierarchical Drawings. J. Graph Algorithms Appl. 23(3): 553-578 (2019)
• 
  Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
  Planar drawings of fixed-mobile bigraphs. Theor. Comput. Sci. 795: 408-419 (2019)
• 
  Giacomo Ortali, Ioannis G. Tollis:
  Multidimensional Dominance Drawings. CoRR abs/1906.09224 (2019)
• 
  Panagiotis Lionakis, Giacomo Ortali, Ioannis G. Tollis:
  Adventures in Abstraction: Reachability in Hierarchical Drawings. CoRR abs/1907.11662 (2019)
• 2018
• 
  Walter Didimo, Evgenios M. Kornaropoulos, Fabrizio Montecchiani, Ioannis G. Tollis:
  A Visualization Framework and User Studies for Overloaded Orthogonal Drawings. Comput. Graph. Forum 37(1): 288-300 (2018)
• 
  Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
  Algorithms and Bounds for L-Drawings of Directed Graphs. Int. J. Found. Comput. Sci. 29(4): 461-480 (2018)
• 
  Giacomo Ortali, Ioannis G. Tollis:
  Algorithms and Bounds for Drawing Directed Graphs. GD 2018: 579-592
• 
  Konstantinos G. Kakoulis, Ioannis G. Tollis:
  Automatic Placement of Labels in Maps and Drawings. Handbook of Approximation Algorithms and Metaheuristics (2) 2018
• 
  Giacomo Ortali, Ioannis G. Tollis:
  Algorithms and Bounds for Drawing Directed Graphs. CoRR abs/1808.10364 (2018)
• 2017
• 
  Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis:
  Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus. J. Graph Algorithms Appl. 21(1): 81-102 (2017)
• 
  Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
  Planar Drawings of Fixed-Mobile Bigraphs. GD 2017: 426-439
• 
  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. GD 2017: 465-478
• 
  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. CoRR abs/1708.09107 (2017)
• 
  Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
  Planar Drawings of Fixed-Mobile Bigraphs. CoRR abs/1708.09238 (2017)
• 2016
• 
  Konstantinos G. Kakoulis, Ioannis G. Tollis:
  Modifying Orthogonal Drawings for Label Placement. Algorithms 9(2): 22 (2016)
• 
  Evgenios M. Kornaropoulos, Ioannis G. Tollis:
  Algorithms for Overloaded Orthogonal Drawings. J. Graph Algorithms Appl. 20(2): 217-246 (2016)

skipping 141 more matches