#### Filter Results:

- Full text PDF available (66)

#### Publication Year

1999

2018

- This year (6)
- Last 5 years (64)
- Last 10 years (96)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Thomas BlÃ¤sius, Ignaz Rutter
- SODA
- 2013

In this article, we define and study the new problem of S<scp>imultaneous</scp> PQ-O<scp>rdering</scp>. Its input consists of a set of PQ-trees, which represent sets of circular orders of theirâ€¦ (More)

- Pavel KlavÃk, Jan KratochvÃl, +4 authors TomÃ¡s Vyskocil
- Algorithmica
- 2014

The recently introduced problem of extending partial interval representations asks, for an interval graph with some intervals pre-drawn by the input, whether the partial representation can beâ€¦ (More)

- Thomas BlÃ¤sius, Stephen G. Kobourov, Ignaz Rutter
- Handbook of Graph Drawing and Visualization
- 2013

Simultaneous embedding is concerned with simultaneously representing a series of graphs sharing some or all vertices. This forms the basis for the visualization of dynamic graphs and thus is anâ€¦ (More)

- Patrizio Angelini, Giuseppe Di Battista, +4 authors Ignaz Rutter
- SODA
- 2010

We study the following problem: Given a planar graph G and a planar drawing (embedding) of a subgraph of G, can such a drawing be extended to a planar drawing of the entire graph G? This problem fitsâ€¦ (More)

- Ignaz Rutter, Alexander Wolff
- J. Graph Algorithms Appl.
- 2008

In this paper we study some connectivity augmentation problems. Given a connected graph G with some property P, we want to make G 2-vertex connected (or 2-edge connected) by adding edges such thatâ€¦ (More)

- Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff
- Graph Drawing
- 2009

In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains of axis-parallelâ€¦ (More)

- Andreas Gemsa, Martin NÃ¶llenburg, Ignaz Rutter
- WADS
- 2011

Dynamic maps that allow continuous map rotations encounter new issues unseen in static map labeling before. We study the following dynamic map labeling problem: Given a set of points P in the planeâ€¦ (More)

- Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
- STACS
- 2014

We consider the problem of online dynamic power management that provides hard real-time guarantees for multi-processor systems. In this problem, a set of jobs, each associated with an arrival time, aâ€¦ (More)

- Andreas Gemsa, Martin NÃ¶llenburg, Thomas Pajor, Ignaz Rutter
- SOFSEM
- 2011

Motivated by drawing route sketches, we consider the d-regular path schematization problem. For this problem we are given an embedded path P (e.g., a route in a road network) and a positive integerâ€¦ (More)

- Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner
- ISAAC
- 2012

We explore the machine-minimizing job scheduling problem, which has a rich history in the line of research, under an online setting. We consider systems with arbitrary job arrival times, arbitraryâ€¦ (More)