Ioannis G. Tollis

Theor. Comput. Sci., 2024

Parameterized Linear Time Transitive Closure.

[BibT_eX]

[DOI]

CoRR, 2024

Weakly Leveled Planarity with Bounded Span.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Effective Computation of a Feedback Arc Set Using PageRank.

[BibT_eX]

[DOI]

Vasileios Geladaris

J. Graph Algorithms Appl., 2023

Planar L-Drawings of Directed Graphs.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

Experiments and a User Study for Hierarchical Drawings of Graphs.

[BibT_eX]

[DOI]

IEEE Access, 2023

Fast Reachability Using DAG Decomposition.

[BibT_eX]

[DOI]

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Dominance Drawings for DAGs with Bounded Modular Width.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

2022

Fast and Practical DAG Decomposition with Reachability Applications.

[BibT_eX]

[DOI]

CoRR, 2022

Computing Weak Dominance Drawings with Minimum Number of Fips.

[BibT_eX]

[DOI]

CoRR, 2022

Computing a Feedback Arc Set Using PageRank.

[BibT_eX]

[DOI]

Vasileios Geladaris

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021

Constant-Time Reachability in DAGs Using Multidimensional Dominance Drawings.

[BibT_eX]

[DOI]

SN Comput. Sci., 2021

2020

Algorithms for visualizing phylogenetic networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Algorithms and Experiments Comparing Two Hierarchical Drawing Frameworks.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Planar drawings of fixed-mobile bigraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

A New Framework for Hierarchical Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Adventures in Abstraction: Reachability in Hierarchical Drawings.

[BibT_eX]

[DOI]

CoRR, 2019

Multidimensional Dominance Drawings.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Algorithms and Bounds for L-Drawings of Directed Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2018

Algorithms and Bounds for Drawing Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Automatic Placement of Labels in Maps and Drawings.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

2016

Algorithms for Overloaded Orthogonal Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2016

Modifying Orthogonal Drawings for Label Placement.

[BibT_eX]

[DOI]

Algorithms, 2016

L-Drawings of Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015

Fan-planarity: Properties and complexity.

[BibT_eX]

[DOI]

Carla Binucci

Antonios Symvonis

Theor. Comput. Sci., 2015

Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs.

[BibT_eX]

[DOI]

Comput. Geom., 2015

2-Layer Fan-Planarity: From Caterpillar to Stegosaurus.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014

Techniques for Edge Stratification of Complex Graph Drawings.

[BibT_eX]

[DOI]

Giuseppe Liotta

J. Vis. Lang. Comput., 2014

Properties and Complexity of Fan-Planarity.

[BibT_eX]

[DOI]

Carla Binucci

CoRR, 2014

How to visualize directed graphs: A user study.

[BibT_eX]

[DOI]

Evangelos Pallas

Proceedings of the 5th International Conference on Information, 2014

Fan-Planar Graphs: Combinatorial Properties and Complexity Results.

[BibT_eX]

[DOI]

Carla Binucci

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Analysis and visualization of metabolic pathways and networks: A hypegraph approach.

[BibT_eX]

[DOI]

Evaggelia Maniadi

Proceedings of IEEE-EMBS International Conference on Biomedical and Health Informatics, 2014

Graph Drawing.

[BibT_eX]

Proceedings of the Computing Handbook, 2014

2013

Circular Drawing Algorithms.

[BibT_eX]

Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Labeling Algorithms.

[BibT_eX]

Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Drawings of Non-planar Graphs with Crossing-free Subgraphs.

[BibT_eX]

[DOI]

CoRR, 2013

Exploring Complex Drawings via Edge Stratification.

[BibT_eX]

[DOI]

Giuseppe Liotta

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Drawing Non-Planar Graphs with Crossing-Free Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Weak Dominance Drawings for Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

DAGView: An Approach for Visualizing Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011

Weak Dominance Drawings and Linear Extension Diameter

[BibT_eX]

[DOI]

CoRR, 2011

BrainNetVis: An Open-Access Tool to Effectively Quantify and Visualize Brain Networks.

[BibT_eX]

[DOI]

Eleni G. Christodoulou

Vangelis Sakkalis

Comput. Intell. Neurosci., 2011

A computational exploration of bacterial metabolic diversity identifying metabolic interactions and growth-efficient strain communities.

[BibT_eX]

[DOI]

BMC Syst. Biol., 2011

Overloaded Orthogonal Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

Learning Causal Structure from Overlapping Variable Sets.

[BibT_eX]

[DOI]

Sofia Triantafilou

Ioannis Tsamardinos

Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, 2010

Guest Editor's Foreword.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

Applications of Parameterized st-Orientations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

Placing Edge Labels by Modifying an Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

2009

DAGmaps: Space Filling Visualization of Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Sofia Triantafilou

J. Graph Algorithms Appl., 2009

DAGmaps and Dominance Relationships.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

DAGmaps and epsilon-Visibility Representations of DAGs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

2008

Algorithms for computing a parameterized st-orientation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Brain Network Analyzer.

[BibT_eX]

[DOI]

Vangelis Sakkalis

Proceedings of the Graph Drawing, 16th International Symposium, 2008

DAGmap View.

[BibT_eX]

[DOI]

Dietrich Rebholz-Schuhmann

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

Medical Informatics and Bioinformatics: A Bibliometric Study.

[BibT_eX]

[DOI]

Jean-Yves Bansard

Eva del Hoyo-Barbolla

Fernando Martín-Sánchez

IEEE Trans. Inf. Technol. Biomed., 2007

On labeling in graph visualization.

[BibT_eX]

[DOI]

Ugur Dogrusöz

Brendan Madden

Inf. Sci., 2007

The Digital Patient - Introduction to the special theme.

[BibT_eX]

[DOI]

Nicholas Ayache

ERCIM News, 2007

Modelling the Pathophysiological Human Brain Function.

[BibT_eX]

[DOI]

Vangelis Sakkalis

ERCIM News, 2007

The Impact of Systems Biology on the Digital Patient.

[BibT_eX]

[DOI]

ERCIM News, 2007

Validating 4D Models of Human Pathophysiology.

[BibT_eX]

[DOI]

Kostas Marias

Thanasis Margaritis

Dietrich Rebholz-Schuhmann

ERCIM News, 2007

SYMBIOmatics: Synergies in Medical Informatics and Bioinformatics - exploring current scientific literature for emerging topics.

[BibT_eX]

[DOI]

Eva del Hoyo-Barbolla

Fernando Martín-Sánchez

BMC Bioinform., 2007

Multi-level Analysis and Information Extraction Considerations for Validating 4D Models of Human Function.

[BibT_eX]

[DOI]

Kostas Marias

Dimitra D. Dionysiou

Georgios S. Stamatakos

Proceedings of the Digital Human Modeling, 2007

Treemaps for Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Sofia Triantafilou

Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006

A framework and algorithms for circular drawings of graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Algorithms for the multiple label placement problem.

[BibT_eX]

[DOI]

Comput. Geom., 2006

Visualization of Functional Aspects of microRNA Regulatory Networks Using the Gene Ontology.

[BibT_eX]

[DOI]

Alkiviadis Symeonidis

Martin Reczko

Proceedings of the Biological and Medical Data Analysis, 7th International Symposium, 2006

Searching and Visualizing Brain Networks in Schizophrenia.

[BibT_eX]

[DOI]

Proceedings of the Biological and Medical Data Analysis, 7th International Symposium, 2006

Parameterized st -Orientations of Graphs: Algorithms and Experiments.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

Time-significant Wavelet Coherence for the Evaluation of Schizophrenic Brain Activity using a Graph theory approach.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference of the IEEE Engineering in Medicine and Biology Society, 2006

On the Topologies of Local Minimum Spanning Trees.

[BibT_eX]

[DOI]

Pier Francesco Cortese

Fabrizio Frati

Luca Grilli

Katharina Anna Lehmann

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005

Using Treemaps to Visualize Phylogenetic Trees.

[BibT_eX]

[DOI]

Adam Arvelakis

Martin Reczko

Alexandros Stamatakis

Alkiviadis Symeonidis

Proceedings of the Biological and Medical Data Analysis, 6th International Symposium, 2005

Applications of Parameterized st-Orientations in Graph Drawing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

2004

Visualization of Biological Information with Circular Drawings.

[BibT_eX]

[DOI]

Alkiviadis Symeonidis

Proceedings of the Biological and Medical Data Analysis, 5th International Symposium, 2004

3D Visualization of Semantic Metadata Models and Ontologies.

[BibT_eX]

[DOI]

Martin Doerr

Proceedings of the Graph Drawing, 12th International Symposium, 2004

ViSta - Visualizing Statecharts.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

2003

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Giuseppe Liotta

J. Graph Algorithms Appl., 2003

A Unified Approach to Automatic Label Placement.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2003

A Framework for User-Grouped Circular Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

Automatic layout of statecharts.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2002

ViSta: a tool suite for the visualization of behavioral requirements.

[BibT_eX]

[DOI]

J. Syst. Softw., 2002

A Framework for the Static and Interactive Visualization of Statecharts.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2002

2001

On the complexity of the Edge Label Placement problem.

[BibT_eX]

[DOI]

Comput. Geom., 2001

Effective Graph Visualization via Node Grouping.

[BibT_eX]

[DOI]

Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01), 2001

Automated Visualization of Process Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

ViSta.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000

A Parallel Algorithm for Planar Orthogonal Grid Drawings.

[BibT_eX]

[DOI]

Jeffrey Scott Vitter

Parallel Process. Lett., 2000

Techniques for the Refinement of Orthogonal Graph Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2000

The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Therese C. Biedl

Brendan Madden

Int. J. Comput. Geom. Appl., 2000

Efficient Orthogonal Drawings of High Degree Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2000

An Algorithmic Framework for Visualizing Statecharts.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999

Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1999

A Framework for Circular Drawings of Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 7th International Symposium, 1999

Circular Drawings of Biconnected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experimentation, 1999

Graph Drawing: Algorithms for the Visualization of Graphs

[BibT_eX]

Prentice-Hall, ISBN: 0-13-301615-3, 1999

1998

Interactive Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1998

Algorithms for area-efficient orthogonal drawings.

[BibT_eX]

[DOI]

Comput. Geom., 1998

Refinement of Orthogonal Graph Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Edge Labeling in the Graph Layout Toolkit.

[BibT_eX]

[DOI]

Ugur Dogrusöz

Brendan Madden

Proceedings of the Graph Drawing, 6th International Symposium, 1998

A Unified Approach to Labeling Graphical Features.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

On the multiple label placement problem.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Area Requirement of Visibility Representations of Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Incremental Orthogonal Graph Drawing in Three Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

An Algorithm for Labeling Edges of Hierarchical Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Area Requirement of Gabriel Drawings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

Optimal algorithms for planar over-the-cell routing problems.

[BibT_eX]

[DOI]

Srinivasa R. Danda

Xiaolin Liu

Sreekrishna Madhwapathy

Anand Panyam

Naveed A. Sherwani

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996

An Omega(k2) lower bound for area optimization of spiral floorplans.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996

Graph Drawing and Information Visualization.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1996

A Pairing Technique for Area-Efficient Orthogonal Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

On the Edge Label Placement Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995

Report on graph drawing '94.

[BibT_eX]

[DOI]

SIGACT News, 1995

Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

A 2n-2 Step Algorithm for Routing in an n*n Array with Constant-Size Queues.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Fillia Makedon

Algorithmica, 1995

Issues in Interactive Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994

Area Optimization of Slicing Floorplans in Parallel.

[BibT_eX]

[DOI]

VLSI Design, 1994

Algorithms and bounds for layer assignment of MCM routing.

[BibT_eX]

[DOI]

Mohammad Hossain Heydari

Chunliang Xia

IEEE Trans. Very Large Scale Integr. Syst., 1994

How to Draw a Series-Parallel Digraph.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1994

Algorithms for Drawing Graphs: an Annotated Bibliography.

[BibT_eX]

[DOI]

Comput. Geom., 1994

A New Approach to Floorplan Area Optimization: To Slice or not to Slice?

[BibT_eX]

[DOI]

Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994

Improved Techniques for MCM Layer Assignment.

[BibT_eX]

[DOI]

Mohammad Hossain Heydari

Chunliang Xia

Proceedings of the Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors, 1994

Improving over-the-cell channel routing in standard cell design.

[BibT_eX]

[DOI]

Xiaolin Liu

Proceedings of the 1994 IEEE/ACM International Conference on Computer-Aided Design, 1994

Drawing Telecommunication Networks.

[BibT_eX]

[DOI]

Chunliang Xia

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Improved Algorithms and Bounds for Orthogonal Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Difference bases and sparse sensor arrays.

[BibT_eX]

[DOI]

Darel A. Linebarger

Ivan Hal Sudborough

IEEE Trans. Inf. Theory, 1993

Dynamic Reachability in Planar Digraphs with One Source and One Sink.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Visibility representations of planar graphs (abstract).

[BibT_eX]

[DOI]

SIGACT News, 1993

Area Optimization of Spiral floorplans.

[BibT_eX]

[DOI]

J. Circuits Syst. Comput., 1993

River routing and density minimization for channels with interchangeable terminals.

[BibT_eX]

[DOI]

Spyros Tragoudas

Integr., 1993

A Fast Parallel Algorithm for Slicing Floorplans.

[BibT_eX]

Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

1992

Improved Techniques for wiring and stretching Layouts.

[BibT_eX]

[DOI]

Andre V. Vaguine

J. Circuits Syst. Comput., 1992

Constrained Visibility Representations of Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Area Requirement and Symmetry Display of Planar Upward Drawings.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1992

How to Draw a Series-Parallel Digraph (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1992

A Framework for Dynamic Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

A new approach to wiring layouts.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1991

Representations of Graphs on a Cylinder.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

Lower Bounds for Planar Orthogonal Drawings of Graphs.

[BibT_eX]

[DOI]

Jeffrey Scott Vitter

Inf. Process. Lett., 1991

Wiring in uniform grids and two-colorable maps.

[BibT_eX]

[DOI]

Integr., 1991

Lower bounds and parallel algorithms for planar orthogonal grid drawings.

[BibT_eX]

[DOI]

Jeffrey Scott Vitter

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

An Optimal Algorithm for Spiral Floorplan Designs.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1991 IEEE International Conference on Computer Design: VLSI in Computer & Processors, 1991

1990

Path planning in the presence of vertical obstacles.

[BibT_eX]

[DOI]

Laxmi P. Gewali

Simeon C. Ntafos

IEEE Trans. Robotics Autom., 1990

Searching on a Tape.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1990

Wiring layouts in the tri-hexagonal grid.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1990

Parallel algorithms for slicing floorplan designs.

[BibT_eX]

[DOI]

Balakrishnan Krishnamurthy

Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

1989

Improved Techniques for Estimating Signal Probabilities.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1989

Automatic layout of PERT diagrams with X-PERT.

[BibT_eX]

[DOI]

Proceedings of the IEEE Workshop on Visual Languages, 1989

A 2n-2 Step Algorithm for Routing in an nxn Array with Constant Size Queues.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Fillia Makedon

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Area Requirement and Symmetry Display in Drawing Graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Algorithms for VLSI Layout

[BibT_eX]

[DOI]

PhD thesis, 1988

A New Algorithm for Wiring Layouts.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

Channel Routing with Short Wires.

[BibT_eX]

[DOI]

Michael Kaufmann

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1986

A Unified Approach a Visibility Representation of Planar Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1986

Centipede Graphs and Visibility on a Cylinder.

[BibT_eX]

[DOI]

Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

Algorithms for Visibility Representations of Planar Graphs.

[BibT_eX]

[DOI]