Ignaz Rutter

From MaRDI portal
Person:306262

Available identifiers

zbMath Open rutter.ignazDBLP99/44WikidataQ102387817 ScholiaQ102387817MaRDI QIDQ306262

List of research outcomes





PublicationDate of PublicationType
Simultaneous representation of interval graphs in the sunflower case2025-01-06Paper
Parameterized complexity of vertex splitting to pathwidth at most 12024-11-18Paper
On 3-coloring circle graphs2024-11-12Paper
Parameterized complexity of simultaneous planarity2024-10-14Paper
Partial and simultaneous transitive orientations via modular decompositions2024-09-11Paper
Maintaining triconnected components under node expansion2024-09-10Paper
Extending partial representations of circle graphs in near-linear time2024-08-06Paper
Extending partial representations of circle graphs in near-linear time2024-08-02Paper
Experimental comparison of PC-trees and PQ-trees2024-07-26Paper
On 3-coloring circle graphs2024-06-21Paper
Constrained planarity in practice: engineering the synchronized planarity algorithm2024-05-29Paper
Parameterized Complexity of Vertex Splitting to Pathwidth at Most 12024-05-03Paper
Partial and simultaneous transitive orientations via modular decompositions2024-04-02Paper
https://portal.mardi4nfdi.de/entity/Q61475162024-01-15Paper
A topology-shape-metrics framework for ortho-radial graph drawing2023-12-21Paper
Drawing Simultaneously Embedded Graphs with Few Bends2023-11-16Paper
https://portal.mardi4nfdi.de/entity/Q60653972023-11-14Paper
Synchronized Planarity with Applications to Constrained Planarity Problems2023-10-23Paper
Maintaining triconnected components under node expansion2023-10-04Paper
https://portal.mardi4nfdi.de/entity/Q60759332023-09-20Paper
https://portal.mardi4nfdi.de/entity/Q60759062023-09-20Paper
Morphing rectangular duals2023-08-16Paper
The Rique-number of graphs2023-08-16Paper
Coloring mixed and directional interval graphs2023-08-16Paper
Untangling circular drawings: algorithms and complexity2023-06-20Paper
https://portal.mardi4nfdi.de/entity/Q61593472023-06-01Paper
Extending partial representations of circular-arc graphs2023-05-05Paper
Parameterized complexity of graph planarity with restricted cyclic orders2023-05-05Paper
Parameterized complexity of graph planarity with restricted cyclic orders2023-04-21Paper
Extending partial representations of rectangular duals with given contact orientations2023-03-22Paper
On Turn-Regular Orthogonal Representations2022-11-14Paper
Level-planarity: transitivity vs. even crossings2022-11-08Paper
Approximation Algorithms for Facial Cycles in Planar Embeddings2022-07-21Paper
Efficient Algorithms for Ortho-Radial Graph Drawing.2022-07-18Paper
Extending Partial Orthogonal Drawings2022-06-28Paper
https://portal.mardi4nfdi.de/entity/Q50758242022-05-11Paper
https://portal.mardi4nfdi.de/entity/Q50758282022-05-11Paper
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations2022-05-10Paper
Inserting an edge into a geometric embedding2022-01-03Paper
Towards a Characterization of Stretchable Aligned Graphs2021-12-01Paper
An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings2021-12-01Paper
On Turn-Regular Orthogonal Representations2021-12-01Paper
Graph Drawing Contest Report2021-12-01Paper
Extending Partial Orthogonal Drawings2021-12-01Paper
Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)2021-09-10Paper
Simultaneous Embedding2021-07-22Paper
Simultaneous FPQ-ordering and hybrid planarity testing2021-06-22Paper
Radial Level Planarity with Fixed Embedding2021-06-17Paper
Graph drawing contest report2020-10-26Paper
An SPQR-tree-like embedding representation for upward planarity2020-10-26Paper
Simultaneous FPQ-ordering and hybrid planarity testing2020-07-20Paper
Reaching 3-connectivity via edge-edge additions2020-02-25Paper
Drawing Clustered Planar Graphs on Disk Arrangements2020-02-17Paper
Beyond level planarity: cyclic, torus, and simultaneous level planarity2019-12-27Paper
Planarity of streamed graphs2019-11-13Paper
Drawing Clustered Graphs on Disk Arrangements2019-10-15Paper
How to Draw a Planarization2019-09-16Paper
A Geometric Heuristic for Rectilinear Crossing Minimization2019-09-12Paper
Simultaneous Representation of Proper and Unit Interval Graphs2019-08-23Paper
NodeTrix planarity testing with small clusters2019-08-20Paper
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems2019-05-15Paper
Windrose Planarity2019-03-28Paper
Scalable exact visualization of isocontours in road networks via minimum-link paths2019-02-27Paper
Aligned Drawings of Planar Graphs2019-02-20Paper
Gap-Planar Graphs2019-02-20Paper
NodeTrix planarity testing with small clusters2019-02-20Paper
Inserting an edge into a geometric embedding2019-02-15Paper
Level planarity: transitivity vs. even crossings2019-02-15Paper
Optimal Orthogonal Graph Drawing with Convex Bend Costs2018-11-05Paper
Testing Planarity of Partially Embedded Graphs2018-10-30Paper
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems2018-10-30Paper
Aligned Drawings of Planar Graphs2018-10-25Paper
Gap-planar graphs2018-09-24Paper
Linear-time recognition of map graphs with outerplanar witness2018-08-17Paper
Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings2018-08-13Paper
Partial and Constrained Level Planarity2018-07-16Paper
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges2018-07-16Paper
Simultaneous embedding: edge orderings, relative positions, cutvertices2018-05-23Paper
Orthogonal graph drawing with inflexible edges2018-01-19Paper
On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs2018-01-04Paper
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions2017-10-20Paper
Linear-Time Recognition of Map Graphs with Outerplanar Witness2017-10-17Paper
Intersection-Link Representations of Graphs2017-10-12Paper
Evaluation of Labeling Strategies for Rotating Maps2017-06-16Paper
Extending partial representations of proper and unit interval graphs2017-05-02Paper
How to Draw a Planarization2017-04-04Paper
On self-approaching and increasing-chord drawings of 3-connected planar graphs2017-03-30Paper
Consistent labeling of rotating maps2017-03-30Paper
https://portal.mardi4nfdi.de/entity/Q29654862017-03-03Paper
Simultaneous Orthogonal Planarity2017-02-21Paper
Beyond Level Planarity2017-02-21Paper
Pixel and Voxel Representations of Graphs2017-02-10Paper
Intersection-Link Representations of Graphs2017-02-10Paper
Extending convex partial drawings of graphs2016-11-01Paper
Multi-sided boundary labeling2016-11-01Paper
Search-space size in contraction hierarchies2016-08-31Paper
Strengthening Hardness Results to 3-Connected Planar Graphs2016-07-08Paper
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions2016-01-11Paper
Many-to-One Boundary Labeling with Backbones2016-01-07Paper
A new perspective on clustered planarity as a combinatorial embedding problem2015-12-08Paper
Optimal Shuffle Code with Permutation Instructions2015-10-30Paper
Regular augmentation of planar graphs2015-10-19Paper
Orthogonal Graph Drawing with Inflexible Edges2015-09-21Paper
Planarity of streamed graphs2015-09-21Paper
Planar Embeddings with Small and Uniform Faces2015-09-11Paper
Online dynamic power management with hard real-time guarantees2015-07-24Paper
TESTING MUTUAL DUALITY OF PLANAR GRAPHS2015-07-01Paper
Disconnectivity and relative positions in simultaneous embeddings2015-06-17Paper
Column-Based Graph Layouts2015-01-15Paper
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs2015-01-07Paper
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem2015-01-07Paper
Drawing Simultaneously Embedded Graphs with Few Bends2015-01-07Paper
Orthogonal graph drawing with flexibility constraints2014-12-02Paper
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model2014-10-08Paper
Computing large matchings fast2014-09-09Paper
Extending partial representations of proper and unit interval graphs2014-09-02Paper
https://portal.mardi4nfdi.de/entity/Q54176192014-05-22Paper
Fork-forests in bi-colored complete bipartite graphs2014-04-16Paper
A kuratowski-type theorem for planarity of partially embedded graphs2014-03-24Paper
On \(d\)-regular schematization of embedded paths2014-01-22Paper
Generalizing geometric graphs2014-01-22Paper
Testing Mutual Duality of Planar Graphs2014-01-14Paper
Drawing Planar Graphs with a Prescribed Inner Face2013-12-20Paper
Many-to-One Boundary Labeling with Backbones2013-12-20Paper
Simultaneous embedding: edge orderings, relative positions, cutvertices2013-12-20Paper
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings2013-12-20Paper
The density maximization problem in graphs2013-12-09Paper
Edge-weighted contact representations of planar graphs2013-08-13Paper
Two-Sided Boundary Labeling with Adjacent Sides2013-08-12Paper
Search-Space Size in Contraction Hierarchies2013-08-06Paper
Optimal Orthogonal Graph Drawing with Convex Bend Costs2013-08-06Paper
On the complexity of partitioning graphs for arc-flags2013-07-09Paper
Augmenting the Connectivity of Planar and Geometric Graphs2013-06-28Paper
https://portal.mardi4nfdi.de/entity/Q52989102013-06-25Paper
Column-Based Graph Layouts2013-04-03Paper
Disconnectivity and Relative Positions in Simultaneous Embeddings2013-04-03Paper
Edge-Weighted Contact Representations of Planar Graphs2013-04-03Paper
Cubic Augmentation of Planar Graphs2013-03-21Paper
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem2013-03-21Paper
A Kuratowski-type theorem for planarity of partially embedded graphs2013-03-07Paper
Hamiltonian orthogeodesic alternating paths2013-01-18Paper
Augmenting the Connectivity of Planar and Geometric Graphs2012-12-04Paper
An algorithmic study of switch graphs2012-10-15Paper
On the complexity of partitioning graphs for arc-flags2012-10-02Paper
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph2012-09-13Paper
Generalizing Geometric Graphs2012-03-09Paper
Hamiltonian Orthogeodesic Alternating Paths2012-01-13Paper
The Density Maximization Problem in Graphs2011-08-17Paper
Consistent Labeling of Rotating Maps2011-08-12Paper
Computing large matchings in planar graphs with fixed minimum degree2011-07-27Paper
Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree2011-05-19Paper
On d-Regular Schematization of Embedded Paths2011-02-15Paper
Orthogonal Graph Drawing with Flexibility Constraints2011-02-11Paper
https://portal.mardi4nfdi.de/entity/Q35793702010-08-06Paper
Manhattan-Geodesic Embedding of Planar Graphs2010-04-27Paper
An Algorithmic Study of Switch Graphs2010-01-21Paper
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree2009-12-17Paper

Research outcomes over time

This page was built for person: Ignaz Rutter