Michael Kaufmann

According to our database1, Michael Kaufmann authored at least 262 papers between 1986 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
On dispersable book embeddings.
Theor. Comput. Sci., 2021

Stable visualization of connected components in dynamic graphs.
Inf. Vis., 2021

The Mixed Page Number of Graphs.
CoRR, 2021

A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution.
Comput. J., 2021

Using the Metro-Map Metaphor for Drawing Hypergraphs.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

2020
On RAC drawings of graphs with one bend per edge.
Theor. Comput. Sci., 2020

Four Pages Are Indeed Necessary for Planar Graphs.
J. Comput. Geom., 2020

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity.
J. Graph Algorithms Appl., 2020

An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs.
CoRR, 2020

Monotone Arc Diagrams with few Biarcs.
CoRR, 2020

On Layered Fan-Planar Graph Drawings.
CoRR, 2020

Queue Layouts of Planar 3-Trees.
Algorithmica, 2020

The Stub Resolution of 1-Planar Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Layered Fan-Planar Graph Drawings.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Lazy Queue Layouts of Posets.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

On Compact RAC Drawings.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
On 3D visibility representations of graphs with few crossings per edge.
Theor. Comput. Sci., 2019

Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092).
Dagstuhl Reports, 2019

Coloring outerplanar graphs and planar 3-trees with small monochromatic components.
CoRR, 2019

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings.
Algorithmica, 2019

On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

The QuaSEFE Problem.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018
Algorithms and insights for RaceTrack.
Theor. Comput. Sci., 2018

1-Fan-bundle-planar drawings of graphs.
Theor. Comput. Sci., 2018

Guest Editors' Foreword and Overview.
J. Graph Algorithms Appl., 2018

Small Universal Point Sets for k-Outerplanar Graphs.
Discret. Comput. Geom., 2018

Queue Layouts of Planar 3-Trees.
CoRR, 2018

Table cartogram.
Comput. Geom., 2018

Planar Bus Graphs.
Algorithmica, 2018

On Dispersable Book Embeddings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

The Number of Crossings in Multigraphs with No Empty Lens.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Bounded Stub Resolution for Some Maximal 1-Planar Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017
The planar tree packing theorem.
J. Comput. Geom., 2017

Progress on Partial Edge Drawings.
J. Graph Algorithms Appl., 2017

On the Total Number of Bends for Planar Octilinear Drawings.
J. Graph Algorithms Appl., 2017

Vertex-Coloring with Defects.
J. Graph Algorithms Appl., 2017

The maximum k-differential coloring problem.
J. Discrete Algorithms, 2017

Threshold-coloring and unit-cube contact representation of planar graphs.
Discret. Appl. Math., 2017

Beyond-Planarity: Density Results for Bipartite Graphs.
CoRR, 2017

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs.
Algorithmica, 2017

The Book Thickness of 1-Planar Graphs is Constant.
Algorithmica, 2017

An Interactive Tool to Explore and Improve the Ply Number of Drawings.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

On Vertex- and Empty-Ply Proximity Drawings.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

3D Visibility Representations of 1-planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

On Optimal 2- and 3-Planar Graphs.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452).
Dagstuhl Reports, 2016

On the Density of 3-Planar Graphs.
CoRR, 2016

Multi-omics enrichment analysis using the GeneTrail2 web service.
Bioinform., 2016

Vertex-Coloring with Star-Defects.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

On Contact Graphs with Cubes and Proportional Boxes.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

AVDTC of generalized 3-Halin graphs.
Proceedings of the 7th International Conference on Information, 2016

On the Density of Non-simple 3-Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization, 2016

Low Ply Drawings of Trees.
Proceedings of the Graph Drawing and Network Visualization, 2016

2015
Planar Octilinear Drawings with One Bend Per Edge.
J. Graph Algorithms Appl., 2015

Many-to-One Boundary Labeling with Backbones.
J. Graph Algorithms Appl., 2015

Fitting Planar Graphs on Planar Maps.
J. Graph Algorithms Appl., 2015

Network-based interactive navigation and analysis of large biological datasets.
it Inf. Technol., 2015

Contact Representations of Sparse Planar Graphs.
CoRR, 2015

Approximating Minimum Manhattan Networks in Higher Dimensions.
Algorithmica, 2015

The Effect of Almost-Empty Faces on Planar Kandinsky Drawings.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

On Bar (1, j)-Visibility Graphs - (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Contact Graphs of Circular Arcs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

The Maximum k-Differential Coloring Problem.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

A New Approach to Partial MUS Enumeration.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Low ply graph drawing.
Proceedings of the 6th International Conference on Information, 2015

A practical approach for 1/4-SHPEDs.
Proceedings of the 6th International Conference on Information, 2015

Sloginsky drawings of graphs.
Proceedings of the 6th International Conference on Information, 2015

PED User Study.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

On Embeddability of Buses in Point Sets.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

The Book Embedding Problem from a SAT-Solving Perspective.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

A Universal Point Set for 2-Outerplanar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

1-Planar Graphs have Constant Book Thickness.
Proceedings of the Algorithms - ESA 2015, 2015

2014
On the Upward Planarity of Mixed Plane Graphs.
J. Graph Algorithms Appl., 2014

Bar 1-Visibility Graphs vs. other Nearly Planar Graphs.
J. Graph Algorithms Appl., 2014

1-Bend Orthogonal Partial Edge Drawing.
J. Graph Algorithms Appl., 2014

Slanted Orthogonal Drawings: Model, Algorithms and Evaluations.
J. Graph Algorithms Appl., 2014

Universal Point Sets for Drawing Planar Graphs with Circular Arcs.
J. Graph Algorithms Appl., 2014

A note on maximum differential coloring of planar graphs.
J. Discrete Algorithms, 2014

The Density of Fan-Planar Graphs.
CoRR, 2014

Bend-optimal orthogonal graph drawing in the general position model.
Comput. Geom., 2014

On the area requirements of Euclidean minimum spanning trees.
Comput. Geom., 2014

Smooth Orthogonal Drawings of Planar Graphs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Upward-rightward planar drawings.
Proceedings of the 5th International Conference on Information, 2014

Sloggy drawings of graphs.
Proceedings of the 5th International Conference on Information, 2014

Boundary Labeling Methods for Dynamic Focus Regions.
Proceedings of the IEEE Pacific Visualization Symposium, 2014

Rebuilding KEGG Maps: Algorithms and Benefits.
Proceedings of the IEEE Pacific Visualization Symposium, 2014

2013
Smooth Orthogonal Layouts.
J. Graph Algorithms Appl., 2013

Geometric RAC Simultaneous Drawings of Graphs.
J. Graph Algorithms Appl., 2013

Computing Cartograms with Optimal Complexity.
Discret. Comput. Geom., 2013

Maximum Differential Coloring of Caterpillars and Spiders
CoRR, 2013

Threshold Coloring and Unit-Cube Contact Representation of Graphs
CoRR, 2013

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs.
CoRR, 2013

On upward point set embeddability.
Comput. Geom., 2013

Approximate proximity drawings.
Comput. Geom., 2013

NetworkTrail - a web service for identifying and visualizing deregulated subnetworks.
Bioinform., 2013

Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations.
Algorithmica, 2013

Threshold-Coloring and Unit-Cube Contact Representation of Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Planar Packing of Binary Trees.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

MUStICCa: MUS Extraction with Interactive Choice of Candidates.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Slanted Orthogonal Drawings.
Proceedings of the Graph Drawing - 21st International Symposium, 2013


On the Characterization of Plane Bus Graphs.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Universal Point Sets for Planar Graph Drawings with Circular Arcs.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
On a Tree and a Path with no Geometric Simultaneous Embedding.
J. Graph Algorithms Appl., 2012

Proportional Contact Representations of Planar Graphs.
J. Graph Algorithms Appl., 2012

Vertex angle and crossing angle resolution of leveled tree drawings.
Inf. Process. Lett., 2012

miRTrail - a comprehensive webserver for analyzing gene and miRNA patterns to enhance the understanding of regulatory mechanisms in diseases.
BMC Bioinform., 2012

Optimal Polygonal Representation of Planar Graphs.
Algorithmica, 2012

CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers - (Tool Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Mad at Edge Crossings? Break the Edges!
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011
A systematic approach to the one-mode projection of bipartite graphs.
Soc. Netw. Anal. Min., 2011

On the Perspectives Opened by Right Angle Crossing Drawings.
J. Graph Algorithms Appl., 2011

Straight-Line Rectangular Drawings of Clustered Graphs.
Discret. Comput. Geom., 2011

Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191).
Dagstuhl Reports, 2011

Geometric Simultaneous RAC Drawings of Graphs
CoRR, 2011

Polynomial area bounds for MST embeddings of trees.
Comput. Geom., 2011

Colored Simultaneous Geometric Embeddings and Universal Pointsets.
Algorithmica, 2011

Beyond Unit Propagation in SAT Solving.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Upward Point-Set Embeddability.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Combining Traditional Map Labeling with Boundary Labeling.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Upward Point Set Embeddability for Convex Point Sets Is in P.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Combining Problems on RAC Drawings and Simultaneous Graph Drawings.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Small Point Sets for Simply-Nested Planar Graphs.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010
On Metro-Line Crossing Minimization.
J. Graph Algorithms Appl., 2010

Comparing trees via crossing minimization.
J. Comput. Syst. Sci., 2010

Visuelle Analytik biologischer Daten.
Inform. Spektrum, 2010

Area-Feature Boundary Labeling.
Comput. J., 2010

Boundary Labeling with Octilinear Leaders.
Algorithmica, 2010

An automatic layout algorithm for BPEL processes.
Proceedings of the ACM 2010 Symposium on Software Visualization, 2010

Optimal Polygonal Representation of Planar Graphs.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Improving Layered Graph Layouts with Edge Bundling.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

Visualizing Differences between Two Large Graphs.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

Upward Geometric Graph Embeddings into Point Sets.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

2009
Constrained Simultaneous and Near-Simultaneous Embeddings.
J. Graph Algorithms Appl., 2009

Planar packing of trees and spider trees.
Inf. Process. Lett., 2009

Two trees which are self-intersecting when drawn simultaneously.
Discret. Math., 2009

A novel algorithm for detecting differentially regulated paths based on gene set enrichment analysis.
Bioinform., 2009

An Interactive Layout Tool for BPMN.
Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing, 2009

Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Visualization of Complex BPEL Models.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Modeling and Designing Real-World Networks.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

On Map Labeling with Leaders.
Proceedings of the Efficient Algorithms, 2009

2008
Guest Editor's Foreword.
J. Graph Algorithms Appl., 2008

Efficient Labeling of Collinear Sites.
J. Graph Algorithms Appl., 2008

Fixed parameter algorithms for one-sided crossing minimization revisited.
J. Discrete Algorithms, 2008

GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments.
BMC Bioinform., 2008

DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment.
Algorithms Mol. Biol., 2008

A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Computation of Renameable Horn Backdoors.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Subdivision Drawings of Hypergraphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Enhancing Visualizations of Business Processes.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

08191 Working Group Report - Visualization of Trajectories.
Proceedings of the Graph Drawing with Applications to Bioinformatics and Social Sciences, 04.05., 2008

2007
Boundary labeling: Models and efficient algorithms for rectangular maps.
Comput. Geom., 2007

BNDB - The Biochemical Network Database.
BMC Bioinform., 2007

Consistent Minimization of Clustering Objective Functions.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007

Packing and Squeezing Subgraphs into Planar Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Polynomial Area Bounds for MST Embeddings of Trees.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Line Crossing Minimization on Metro Maps.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Colored Simultaneous Geometric Embeddings.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Placing connected components of disconnected graphs.
Proceedings of the APVIS 2007, 2007

Labeling collinear sites.
Proceedings of the APVIS 2007, 2007

2006
BN++ - A Biological Information System.
J. Integr. Bioinform., 2006

Visualization aided performance tuning of irregular task-parallel computations.
Inf. Vis., 2006

On the maximal cliques in <i>c</i>-max-tolerance graphs and their application in clustering molecular sequences.
Algorithms Mol. Biol., 2006

Drawing activity diagrams.
Proceedings of the ACM 2006 Symposium on Software Visualization, 2006

Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Multi-stack Boundary Labeling Problems.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Topic 12: Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

Polygon labelling of minimum leader length.
Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2006

2005
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing.
J. Graph Algorithms Appl., 2005

DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment.
BMC Bioinform., 2005

Visualizing structural properties of irregular parallel computations.
Proceedings of the ACM 2005 Symposium on Software Visualization, 2005

Boundary Labelling of Optimal Total Leader Length.
Proceedings of the Advances in Informatics, 2005

Random Graphs, Small-Worlds and Scale-Free Networks.
Proceedings of the Peer-to-Peer Systems and Applications, 2005

Evolutionary algorithms for the self-organized evolution of networks.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Mixed Upward Planarization - Fast and Robust.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

A New Approach for Boundary Recognition in Geometric Sensor Networks.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Automatic layout of UML class diagrams in orthogonal style.
Inf. Vis., 2004

DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors.
BMC Bioinform., 2004

<i>yFiles</i> - Visualization and Automatic Layout of Graphs.
Proceedings of the Graph Drawing Software, 2004

2003
An Approach for Mixed Upward Planarization.
J. Graph Algorithms Appl., 2003

Designing Parallel Algorithms for Hierarchical SMP Clusters.
Int. J. Found. Comput. Sci., 2003

A Topology-Shape-Metrics Approach for the Automatic Layout of UML Class Diagram.
Proceedings of the Proceedings ACM 2003 Symposium on Software Visualization, 2003

Topic Introduction.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

2002
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs.
J. Graph Algorithms Appl., 2002

Guest Editor's Foreword.
J. Graph Algorithms Appl., 2002

Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Algorithms for SMP-Clusters Dense Matrix-Vector Multiplication.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

Graph Drawing Algorithms for Bioinformatics.
Proceedings of the 32. Jahrestagung der Gesellschaft für Informatik, Informatik bewegt, INFORMATIK 2002, Dortmund, Germany, September 30, 2002

Maintaining the Mental Map for Circular Drawings.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Sketch-Driven Orthogonal Graph Drawing.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Electronic brainstorming with graphical structures of ideas.
Proceedings of the 10th European Conference on Information Systems, 2002

BioMiner - modeling, analyzing, and visualizing biochemical pathways and networks.
Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

2001
An Approach for Mixed Upward Planarization.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

kappa NUMA: A Model for Clusters of SMP-Machines.
Proceedings of the Parallel Processing and Applied Mathematics, 2001

An efficient algorithm for finding short approximate non-tandem repeats.
Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001

yFiles: Visualization and Automatic Layout of Graphs.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Usage-based Visualization of Web Locations.
Proceedings of the Australasian Symposium on Information Visualisation, 2001

2000
On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results.
Algorithmica, 2000

Orthogonal graph drawing with constraints.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1998
Drawing Planar Partitions II: HH-Drawings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Adding Constraints to an Algorithm for Orthogonal Graph Drawing.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Visualization of Parallel Execution Graphs.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

On Improving Orthogonal Drawings: The 4M-Algorithm.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997
Deterministic Permutation Routing on Meshes.
J. Algorithms, 1997

Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem.
Discret. Comput. Geom., 1997

Matrix Transpose on Meshes: Theory and Practice.
Comput. Artif. Intell., 1997

Randomized Multipacket Routing and Sorting on Meshes.
Algorithmica, 1997

Routing on Meshes with Buses.
Algorithmica, 1997

On Triangulating Planar Graphs Under the Four-Connectivity Constraint.
Algorithmica, 1997

Algorithms and Area Bounds for Nonplanar Orthogonal Drawings.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice.
Proceedings of the Algorithms, 1997

Area-Efficient Static and Incremental Graph Drawings.
Proceedings of the Algorithms, 1997

On Exact Solutions for the Rectilinear Steiner Tree Problem.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

BSP-Like External-Memory Computation.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

Nice Drawings for Planar Bipartite Graphs.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
An Algorithm for Steiner Trees in Grid Graphs and its Application to Homotopic Routing.
J. Circuits Syst. Comput., 1996

2-Visibility Drawings of Planar Graphs.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995
Routing and Sorting on Reconfigurable Meshes.
Parallel Process. Lett., 1995

Solving Cheap Graph Problems an Meshes.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Drawing High Degree Graphs with Low Bend Numbers.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes.
Proceedings of the Algorithms, 1995

1994
A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs.
SIAM J. Comput., 1994

Channel Routing of Multiterminal Nets.
J. ACM, 1994

Deterministic 1-k Routing on Meshes.
Proceedings of the STACS 94, 1994

Towards practical permutation routing on meshes.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Derandomizing Algorithms for Routing and Sorting on Meshes.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Shorter Queues for Permutation Routing on Meshes.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Fast Deterministic Hot-Potato Routing on Processor Arrays.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Approaching the 5/4-Approximation for Rectilinear Steiner Trees.
Proceedings of the Algorithms, 1994

1993
Routing in Polygons without Rectilinear Visible Corners
Inf. Comput., February, 1993

Drawing Graphs in the Plane with High Resolution.
SIAM J. Comput., 1993

Parity Conditions in Homotopic Knock-Knee Routing.
Algorithmica, 1993

Randomized Routing on Meshes with Buses.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
On local routing of two-terminal nets.
J. Comb. Theory, Ser. B, 1992

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
Algorithmica, 1992

Optimal Multi-Packet Routing on the Torus.
Proceedings of the Algorithm Theory, 1992

Performance Driven k-Layer Wiring.
Proceedings of the STACS 92, 1992

Deterministic Routing on Circular Arrays.
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Matching the Bisection Bound for Routing and Sorting on the Mesh.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

1991
Minimal stretching of a layout to ensure 2-layer wirability.
Integr., 1991

A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs.
Proceedings of the ISA '91 Algorithms, 1991

The Art Gallery Theorem for Polygons With Holes
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
A linear-time algorithm for routing in a convex grid.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990

On the Rectilinear Art Gallery Problem - Algorithmic Aspects.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

Zur Physik des Fusionsreaktors. Neue Ergebnisse.
Proceedings of the Forum '90 Wissenschaft und Technik, 1990

Hierarchical Wiring in Multigrids.
Proceedings of the CONPAR 90, 1990

1989
Advances in Homotopic Layout Compaction.
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

1988
On Continuous Homotopic One Layer Routing.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

On Continuous Homotopic One Layer Routing.
Proceedings of the Computational Geometry and its Applications, 1988

Channel Routing with Short Wires.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
Über Lokales Verdrahten von Zwei-Punkt-Netzen.
PhD thesis, 1987

1986
Routing Through a Generalized Switchbox.
J. Algorithms, 1986


  Loading...