Alexander Wolff

Konstanty Junosza-Szaniawski

J. Graph Algorithms Appl., 2023

The Complexity of Drawing Graphs on Few Lines and Few Planes.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2023

Deciding the Feasibility and Minimizing the Height of Tangles.

[BibT_eX]

[DOI]

CoRR, 2023

Coloring and Recognizing Directed Interval Graphs.

[BibT_eX]

[DOI]

Grzegorz Gutowski

CoRR, 2023

Planar L-Drawings of Directed Graphs.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

Morphing Planar Graph Drawings Through 3D.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees.

[BibT_eX]

[DOI]

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

The Complexity of Finding Tangles.

[BibT_eX]

[DOI]

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

Parameterized Approaches to Orthogonal Compaction.

[BibT_eX]

[DOI]

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

Coloring and Recognizing Mixed Interval Graphs.

[BibT_eX]

[DOI]

Grzegorz Gutowski

Konstanty Junosza-Szaniawski

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

A Simple Pipeline for Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Tim Hegemann

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

The Parametrized Complexity of the Segment Number.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Layered drawing of undirected graphs with generalized port constraints.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Minimum rectilinear polygons for given angle sequences.

[BibT_eX]

[DOI]

Comput. Geom., 2022

The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Coloring Mixed and Directional Interval Graphs.

[BibT_eX]

[DOI]

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

Outside-Obstacle Representations with All Vertices on the Outer Face.

[BibT_eX]

[DOI]

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

Morphing Rectangular Duals.

[BibT_eX]

[DOI]

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

Bounding and Computing Obstacle Numbers of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Angle Covers: Algorithms and Complexity.

[BibT_eX]

[DOI]

William S. Evans

Ellen Gethner

Jack Spalding-Jamieson

J. Graph Algorithms Appl., 2021

ClusterSets: Optimizing Planar Clusters in Categorical Point Data.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2021

Using the Metro-Map Metaphor for Drawing Hypergraphs.

[BibT_eX]

[DOI]

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

Robust Gateway Placement for Scalable LoRaWAN.

[BibT_eX]

[DOI]

Proceedings of the 13th IFIP Wireless and Mobile Networking Conference, 2021

Adjacency Graphs of Polyhedral Surfaces.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Extending Partial Representations of Rectangular Duals with Given Contact Orientations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

Algorithms for Floor Planning with Proximity Requirements.

[BibT_eX]

[DOI]

Jonathan Klawitter

Felix Klesen

Proceedings of the Computer-Aided Architectural Design. Design Imperatives: The Future is Now, 2021

2020

Finding Optimal Sequences for Area Aggregation - A<sup>⋆</sup> vs. Integer Linear Programming.

[BibT_eX]

[DOI]

Dongliang Peng

ACM Trans. Spatial Algorithms Syst., 2020

Drawing graphs on few lines and few planes.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Recognizing Stick Graphs with and without Length Constraints.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

Bundled Crossings Revisited.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

Drawing Graphs with Circular Arcs and Right-Angle Crossings.

[BibT_eX]

[DOI]

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019

Drawing Graphs on Few Circles and Few Spheres.

[BibT_eX]

[DOI]

Myroslav Kryven

Alexander Ravsky

J. Graph Algorithms Appl., 2019

Multi-level Steiner Trees.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Visual Analytics for Sets over Time and Space (Dagstuhl Seminar 19192).

[BibT_eX]

[DOI]

Sara Irina Fabrikant

Silvia Miksch

Dagstuhl Reports, 2019

Compact drawings of 1-planar graphs with right-angle crossings and few bends.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Variants of the Segment Number of a Graph.

[BibT_eX]

[DOI]

Yoshio Okamoto

Alexander Ravsky

Chrysanthi N. Raftopoulou

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Computing Height-Optimal Tangles Faster.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Representing Graphs and Hypergraphs by Touching Polygons in 3D.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Stick Graphs with Length Constraints.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

On Arrangements of Orthogonal Circles.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Line and Plane Cover Numbers Revisited.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

On the Maximum Crossing Number.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Approximating the Generalized Minimum Manhattan Network Problem.

[BibT_eX]

[DOI]

Algorithmica, 2018

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.

[BibT_eX]

[DOI]

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

2017

Block Crossings in Storyline Visualizations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Progress on Partial Edge Drawings.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Martin Nöllenburg

J. Graph Algorithms Appl., 2017

Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling.

[BibT_eX]

[DOI]

ISPRS Int. J. Geo Inf., 2017

Improved Approximation Algorithms for Box Contact Representations.

[BibT_eX]

[DOI]

Algorithmica, 2017

Algorithmically-Guided User Interaction.

[BibT_eX]

[DOI]

Thomas C. van Dijk

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Computing Storyline Visualizations with Few Block Crossings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Beyond Outerplanarity.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

Matching Labels and Markers in Historical Maps: An Algorithm with Interactive Postprocessing.

[BibT_eX]

[DOI]

Benedikt Budig

Thomas C. van Dijk

ACM Trans. Spatial Algorithms Syst., 2016

Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2016

Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition.

[BibT_eX]

[DOI]

Fabian Lipp

Johannes Zink

Algorithms, 2016

Multi-sided Boundary Labeling.

[BibT_eX]

[DOI]

Algorithmica, 2016

Snapping Graph Drawings to the Grid Optimally.

[BibT_eX]

[DOI]

Andre Löffler

Thomas C. van Dijk

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Obstructing Visibilities with One Obstacle.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Continuous Generalization of Administrative Boundaries Based on Compatible Triangulations.

[BibT_eX]

[DOI]

Dongliang Peng

Proceedings of the Geospatial Data in a Changing World, 2016

2015

Ordering Metro Lines by Block Crossings.

[BibT_eX]

[DOI]

Martin Fink

Sergey Pupyrev

J. Graph Algorithms Appl., 2015

Approximating Minimum Manhattan Networks in Higher Dimensions.

[BibT_eX]

[DOI]

Algorithmica, 2015

Colored Non-crossing Euclidean Steiner Forest.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Pixel and Voxel Representations of Graphs.

[BibT_eX]

[DOI]

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

Labeling Streets Along a Route in Interactive 3D Maps Using Billboards.

[BibT_eX]

[DOI]

Proceedings of the AGILE 2015, 2015

2014

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Stephen K. Wismath

J. Graph Algorithms Appl., 2014

Universal Point Sets for Drawing Planar Graphs with Circular Arcs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Semantic Word Cloud Representations: Hardness and Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Smooth Orthogonal Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Muhammad Jawaherul Alam

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Labeling streets in interactive maps using embedded labels.

[BibT_eX]

[DOI]

Nadine Schwartges

Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

On Monotone Drawings of Trees.

[BibT_eX]

[DOI]

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

Luatodonotes: Boundary Labeling for Annotations in Texts.

[BibT_eX]

[DOI]

Philipp Kindermann

Fabian Lipp

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

Drawing Graphs within Restricted Area.

[BibT_eX]

[DOI]

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

Point Labeling with Sliding Labels in Interactive Maps.

[BibT_eX]

[DOI]

Proceedings of the Connecting a Digital Europe Through Location and Place, 2014

2013

Graph Drawing and Cartography.

[BibT_eX]

Auxiliadora Moreno-González

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

Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2013

Two-Sided Boundary Labeling with Adjacent Sides.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Universal Point Sets for Planar Graph Drawings with Circular Arcs.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Algorithms for Labeling Focus Regions.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2012

Cover Contact Graphs.

[BibT_eX]

[DOI]

Nieves Atienza

Natalia de Castro

Carmen Cortés

María Ángeles Garrido

Clara I. Grima

Carlos G. Hernández

Alberto Márquez

Maria Trinidad Villar

J. Comput. Geom., 2012

Putting Data on the Map (Dagstuhl Seminar 12261).

[BibT_eX]

[DOI]

Stephen G. Kobourov

Frank van Ham

Dagstuhl Reports, 2012

Polylogarithmic Approximation for Generalized Minimum Manhattan Networks

[BibT_eX]

[DOI]

CoRR, 2012

Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Algorithmica, 2012

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Drawing Metro Maps Using Bézier Curves.

[BibT_eX]

[DOI]

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

2011

Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming.

[BibT_eX]

[DOI]

Martin Nöllenburg

IEEE Trans. Vis. Comput. Graph., 2011

Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs.

[BibT_eX]

[DOI]

Nadine Schwartges

Joachim Spoerhase

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

2010

Computing large matchings fast.

[BibT_eX]

[DOI]

Ignaz Rutter

ACM Trans. Algorithms, 2010

Trimming of Graphs, with Application to Point Labeling.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Area aggregation in map generalisation by mixed-integer programming.

[BibT_eX]

[DOI]

Int. J. Geogr. Inf. Sci., 2010

Optimizing active ranges for consistent dynamic map labeling.

[BibT_eX]

[DOI]

Comput. Geom., 2010

The Traveling Salesman Problem under Squared Euclidean Distances.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Optimal and topologically safe simplification of building footprints.

[BibT_eX]

[DOI]

Matthias Müller-Hannemann

Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

10461 Abstracts Collection and Summary - Schematization in Cartography, Visualization, and Computational Geometry.

[BibT_eX]

[DOI]

Jason Dykes

Proceedings of the Schematization in Cartography, Visualization, and Computational Geometry, 14.11., 2010

2009

Constructing Optimal Highways.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2009

Untangling a Planar Graph.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Matching points with rectangles and squares.

[BibT_eX]

[DOI]

Sergey Bereg

Nikolaus Mutsanas

Comput. Geom., 2009

Manhattan-Geodesic Embedding of Planar Graphs.

[BibT_eX]

[DOI]

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

Drawing Binary Tanglegrams: An Experimental Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008

Morphing polylines: A step towards continuous generalization.

[BibT_eX]

[DOI]

Comput. Environ. Urban Syst., 2008

Constructing the City Voronoi Diagram Faster.

[BibT_eX]

[DOI]

Robert Görke

Chan-Su Shin

Int. J. Comput. Geom. Appl., 2008

Augmenting the Connectivity of Planar and Geometric Graphs.

[BibT_eX]

[DOI]

Ignaz Rutter

Electron. Notes Discret. Math., 2008

Decomposing a simple polygon into pseudo-triangles and convex polygons.

[BibT_eX]

[DOI]

Stefan Gerdjikov

Comput. Geom., 2008

Constructing minimum-interference networks.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Delineating Boundaries for Imprecise Regions.

[BibT_eX]

[DOI]

Iris Reinbacher

Marc Benkert

Joseph S. B. Mitchell

Jack Snoeyink

Algorithmica, 2008

Untangling a Planar Graph.

[BibT_eX]

[DOI]

Andreas Spillner

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

Drawing (Complete) Binary Tanglegrams.

[BibT_eX]

[DOI]

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

2007

Drawing Subway Maps: A Survey.

[BibT_eX]

[DOI]

Inform. Forsch. Entwickl., 2007

Configurations with few crossings in topological graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Boundary labeling: Models and efficient algorithms for rectangular maps.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Straightening Drawings of Clustered Hierarchical Graphs.

[BibT_eX]

[DOI]

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

Moving Vertices to Make Drawings Plane.

[BibT_eX]

[DOI]

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

2006

Geometrische Netzwerke und ihre Visualisierung

[BibT_eX]

[DOI]

, 2006

Farthest-point queries with geometric and combinatorial constraints.

[BibT_eX]

[DOI]

Comput. Geom., 2006

The minimum Manhattan network problem: Approximations and exact solutions.

[BibT_eX]

[DOI]

Comput. Geom., 2006

Generalization of land cover maps by mixed integer programming.

[BibT_eX]

[DOI]

Proceedings of the 14th ACM International Symposium on Geographic Information Systems, 2006

Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps.

[BibT_eX]

[DOI]

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

06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006, 2006

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Optimal spanners for axis-aligned rectangles.

[BibT_eX]

[DOI]

Comput. Geom., 2005

A Mixed-Integer Program for Drawing High-Quality Metro Maps.

[BibT_eX]

[DOI]

Martin Nöllenburg

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

Delineating boundaries for imprecise regions.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Spanning trees with few crossings in geometric and topological graphs.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Constructing the city Voronoi diagram faster.

[BibT_eX]

[DOI]

Robert Görke

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Constructing interference-minimal networks.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Delineating Boundaries for Imprecise Regions.

[BibT_eX]

[DOI]

Iris Reinbacher

Marc Benkert

Joseph S. B. Mitchell

Proceedings of the Algorithms, 2005

2004

Facility location and the geometric minimum-diameter spanning tree.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Labeling Points with Weights.

[BibT_eX]

[DOI]

Algorithmica, 2004

The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation.

[BibT_eX]

[DOI]

Marc Benkert

Florian Widmann

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Algorithms for the placement of diagrams on maps.

[BibT_eX]

[DOI]

Étienne Schramm

Proceedings of the 12th ACM International Workshop on Geographic Information Systems, 2004

2002

A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling.

[BibT_eX]

[DOI]

Michael Thon

Yin-Feng Xu

Int. J. Comput. Geom. Appl., 2002

Towards an evaluation of quality for names placement methods.

[BibT_eX]

[DOI]

Int. J. Geogr. Inf. Sci., 2002

A Tutorial for Designing Flexible Geometric Algorithms.

[BibT_eX]

[DOI]

Vikas Kapoor

Dietmar Kühl

Algorithmica, 2002

2001

Labeling Points with Circles.

[BibT_eX]

[DOI]

Tycho Strijk

Int. J. Comput. Geom. Appl., 2001

Three Rules Suffice for Good Label Placement.

[BibT_eX]

[DOI]

Algorithmica, 2001

Labeling Points with Weights.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Labeling Subway Lines.

[BibT_eX]

[DOI]

María Ángeles Garrido

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

A Better Lower Bound for Two-Circle Point Labeling.

[BibT_eX]

[DOI]

Michael Thon

Yin-Feng Xu

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

New Algorithms for Two-Label Point Labeling.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1999

Automated label placement in theory and practice.

[BibT_eX]

[DOI]

PhD thesis, 1999

Point labeling with sliding labels.

[BibT_eX]

[DOI]

Tycho Strijk

Comput. Geom., 1999

1998

A Combinatorial Framework for Map Labeling.

[BibT_eX]

[DOI]

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

Point Set Labeling with Sliding Labels.

[BibT_eX]

[DOI]

Tycho Strijk

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

A Practical Map Labeling Algorithm.

[BibT_eX]

[DOI]

Comput. Geom., 1997

The Hardness of Approximating Set Cover.

[BibT_eX]

[DOI]

Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997

1995

An Efficient and Effective Approximation Algorithm for the Map Labeling Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

Map Labeling Heuristics: Provably Good and Practically Useful.

[BibT_eX]

[DOI]