Search Results - "Rutter, Ignaz"

The Price of Upwardness.

Authors: Angelini, Patrizio Biedl, Therese Chimani, Markus et al.

Source: Discrete Mathematics & Theoretical Computer Science (DMTCS); 2025, Vol. 27 Issue 3, p1-30, 30p

Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings.

Authors: Baumann, Jakob Rutter, Ignaz Sudholt, Dirk

Source: Algorithmica; Jun2026, Vol. 88 Issue 3, p1-50, 50p

Constrained outer-string representations.

Authors: Biedl, Therese Cornelsen, Sabine Kratochvíl, Jan et al.

Source: Discrete Applied Mathematics; Sep2026, Vol. 390, p114-134, 21p

A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing.

Authors: Barth, Lukas Niedermann, Benjamin Rutter, Ignaz et al.

Source: Discrete & Computational Geometry; Dec2023, Vol. 70 Issue 4, p1292-1355, 64p

Synchronized Planarity with Applications to Constrained Planarity Problems.

Authors: BLÄSIUS, THOMAS FINK, SIMON D. RUTTER, IGNAZ

Source: ACM Transactions on Algorithms; Oct2023, Vol. 19 Issue 4, p1-23, 23p

Simultaneous Representation of Proper and Unit Interval Graphs.

Authors: Rutter, Ignaz Strash, Darren Stumpf, Peter et al.

Source: Algorithmica; May2025, Vol. 87 Issue 5, p783-811, 29p

AN SPQR-TREE-LIKE EMBEDDING REPRESENTATION FOR LEVEL PLANARITY.

Authors: Brückner, Guido Rutter, Ignaz

Source: Journal of Computational Geometry. 2023, Vol. 14 Issue 1, p48-77. 30p.

Vulnerability in Social Epistemic Networks.

Authors: Sullivan, Emily Sondag, Max Rutter, Ignaz et al.

Source: International Journal of Philosophical Studies; Dec2020, Vol. 28 Issue 5, p731-753, 23p

Parameterized complexity of graph planarity with restricted cyclic orders.

Authors: Liotta, Giuseppe Rutter, Ignaz Tappini, Alessandra

Source: Journal of Computer & System Sciences. Aug2023, Vol. 135, p125-144. 20p.

Subjects: Representations of graphs, Planar graphs, Graph algorithms

Partial and Simultaneous Transitive Orientations via Modular Decompositions.

Authors: Münch, Miriam Rutter, Ignaz Stumpf, Peter

Source: Algorithmica; Apr2024, Vol. 86 Issue 4, p1263-1292, 30p

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.

Authors: ANGELINI, PATRIZIO DA LOZZO, GIORDANO DI BATTISTA, GIUSEPPE et al.

Source: ACM Transactions on Algorithms; Oct2018, Vol. 14, p1-24, 24p

Weakly leveled planarity with bounded span.

Authors: Bekos, Michael A. Da Lozzo, Giordano Frati, Fabrizio et al.

Source: Theoretical Computer Science; Apr2026, Vol. 1069, pN.PAG-N.PAG, 1p

Experimental Comparison of PC-Trees and PQ-Trees.

Authors: Fink, Simon D. Pfretzschner, Matthias Rutter, Ignaz

Source: Journal of Experimental Algorithmics (JEA); Dec2023, Vol. 28, p1-24, 24p

Drawing Simultaneously Embedded Graphs with Few Bends.

Authors: Grilli, Luca Hong, Seok-Hee Kratochvíl, Jan et al.

Source: International Journal of Foundations of Computer Science; Nov2023, Vol. 34 Issue 7, p807-824, 18p

Partial and constrained level planarity.

Authors: Brückner, Guido Rutter, Ignaz

Source: Theoretical Computer Science. Aug2025, Vol. 1045, pN.PAG-N.PAG. 1p.

Subjects: Polynomial time algorithms, Data structures, Linear orderings, Graph algorithms, Planar graphs, Directed graphs

Optimal Orthogonal Graph Drawing with Convex Bend Costs.

Authors: BLÄSIUS, THOMAS RUTTER, IGNAZ WAGNER, DOROTHEA

Source: ACM Transactions on Algorithms; Apr2016, Vol. 12 Issue 3, p1-32, 32p

Testing Planarity of Partially Embedded Graphs.

Authors: ANGELINI, PATRIZIO DI BATTISTA, GIUSEPPE FRATI, FABRIZIO et al.

Source: ACM Transactions on Algorithms; Apr2015, Vol. 11 Issue 4, p32:1-32:42, 42p

Simple algorithms for partial and simultaneous rectangular duals with given contact orientations.

Authors: Chaplick, Steven Felsner, Stefan Kindermann, Philipp et al.

Source: Theoretical Computer Science; Jun2022, Vol. 919, p66-74, 9p

Simultaneous FPQ-ordering and hybrid planarity testing.

Authors: Liotta, Giuseppe Rutter, Ignaz Tappini, Alessandra

Source: Theoretical Computer Science. Jun2021, Vol. 874, p59-79. 21p.

Subjects: Definitions

An algorithmic study of switch graphs.

Authors: Katz, Bastian Rutter, Ignaz Woeginger, Gerhard

Source: Acta Informatica; Aug2012, Vol. 49 Issue 5, p295-312, 18p, 9 Diagrams