Oswin Aichholzer

Joseph Dorfer

CoRR, August, 2025

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets.

[BibT_eX]

[DOI]

Joseph Dorfer

CoRR, July, 2025

Connected matchings.

[BibT_eX]

[DOI]

Comput. Geom., 2025

Flips in odd matchings.

[BibT_eX]

[DOI]

Comput. Geom., 2025

2024

Perfect Matchings with Crossings.

[BibT_eX]

[DOI]

Algorithmica, March, 2024

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., January, 2024

Folding polyominoes into cubes.

[BibT_eX]

[DOI]

Florian Lehner

Christian Lindorfer

CoRR, 2024

Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs.

[BibT_eX]

[DOI]

Joachim Orthaber

Comput. Geom. Topol., 2024

Bicolored Order Types.

[BibT_eX]

[DOI]

Anna Brötzner

Comput. Geom. Topol., 2024

There is a unique crossing-minimal rectilinear drawing of K_18.

[BibT_eX]

[DOI]

Jesús Leaños

Ars Math. Contemp., 2024

Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles.

[BibT_eX]

[DOI]

Joachim Orthaber

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

2023

Graphs with large total angular resolution.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Geometric dominating sets - a minimum version of the No-Three-In-Line Problem.

[BibT_eX]

[DOI]

David Eppstein

Eva-Maria Hainzl

Comput. Geom., 2023

Flipping Plane Spanning Paths.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2023

Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs.

[BibT_eX]

[DOI]

Alexandra Weinberger

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

Bichromatic Perfect Matchings with Crossings.

[BibT_eX]

[DOI]

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

Drawings of Complete Multipartite Graphs up to Triangle Flips.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

On Compatible Matchings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

Drawing Graphs as Spanners.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

Blocking Delaunay Triangulations from the Exterior.

[BibT_eX]

[DOI]

CoRR, 2022

Reconfiguration of Non-crossing Spanning Trees.

[BibT_eX]

[DOI]

CoRR, 2022

Geometric Dominating Sets.

[BibT_eX]

[DOI]

Virginia Vassilevska Williams

David Eppstein

Eva-Maria Hainzl

CoRR, 2022

Flipping Plane Spanning Paths.

[BibT_eX]

[DOI]

CoRR, 2022

On crossing-families in planar point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Disjoint Compatibility via Graph Classes.

[BibT_eX]

[DOI]

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

Compatible Spanning Trees in Simple Drawings of Kn.

[BibT_eX]

[DOI]

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

Shooting Stars in Simple Drawings of Km, n.

[BibT_eX]

[DOI]

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

Hardness of Token Swapping on Trees.

[BibT_eX]

[DOI]

Nicole Wein

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

Edge Partitions of Complete Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Edge Partitions of Complete Geometric Graphs (Part 2).

[BibT_eX]

[DOI]

CoRR, 2021

Folding polyominoes with holes into a cube.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Flip Distances Between Graph Orientations.

[BibT_eX]

[DOI]

Algorithmica, 2021

Another Small but Long Step for Crossing Numbers: cr(13) = 225 and cr(14) = 315.

[BibT_eX]

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants.

[BibT_eX]

[DOI]

Frank Duque

Oscar E. García-Quintero

Carlos Hidalgo-Toscano

J. Graph Algorithms Appl., 2020

Minimal Representations of Order Types by Geometric Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

A superlinear lower bound on the number of 5-holes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2020

Plane Spanning Trees in Edge-Colored Simple Drawings of Kn.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

Cross-sections of line configurations in R3 and (d - 2)-flat configurations in Rd.

[BibT_eX]

[DOI]

Andres J. Ruiz-Vargas

Comput. Geom., 2019

Packing plane spanning graphs with short edges in complete geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2019

On the 2-Colored Crossing Number.

[BibT_eX]

[DOI]

Adrian Fuchs

Carlos Hidalgo-Toscano

Irene Parada

Francisco Zaragoza

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

On the Edge-Vertex Ratio of Maximal Thrackles.

[BibT_eX]

[DOI]

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

2018

Bishellable drawings of Kn.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Computing balanced islands in two colored point sets in the plane.

[BibT_eX]

[DOI]

Nieves Atienza

Pablo Pérez-Lantero

Inf. Process. Lett., 2018

Folding Polyominoes into (Poly)Cubes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2018

Perfect k-Colored Matchings and $(k+2)$ -Gonal Tilings.

[BibT_eX]

[DOI]

Graphs Comb., 2018

Modem illumination of monotone polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Linear transformation distance for bichromatic matchings.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Holes in 2-convex point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2018

2017

Packing plane spanning trees and paths in complete geometric graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

Packing Short Plane Spanning Graphs in Complete Geometric Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Reconstructing Point Set Order Types from Radial Orderings.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2016

Geometric Achromatic and Pseudoachromatic Indices.

[BibT_eX]

[DOI]

Gabriela Araujo-Pardo

Natalia García-Colín

Dolores Lara

Christian Rubio-Montiel

Graphs Comb., 2016

Packing Short Plane Spanning Trees in Complete Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

An Improved Lower Bound on the Minimum Number of Triangulations.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Embedding Four-directional Paths on Convex Point Sets.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Monotone Simultaneous Embeddings of Upward Planar Digraphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Triangulations with Circular Arcs.

[BibT_eX]

[DOI]

Wolfgang Aigner

Katerina Cech Dobiásová

Bert Jüttler

Günter Rote

J. Graph Algorithms Appl., 2015

3-Colorability of Pseudo-Triangulations.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2015

Empty Triangles in Good Drawings of the Complete Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Characterization of Extremal Antipodal Polygons.

[BibT_eX]

[DOI]

Luis Evaristo Caraballo

Carlos Ochoa

P. Nigsch

Graphs Comb., 2015

Flip Distance Between Triangulations of a Simple Polygon is NP-Complete.

[BibT_eX]

[DOI]

Wolfgang Mulzer

Alexander Pilz

Discret. Comput. Geom., 2015

Balanced Islands in Two Colored Point Sets in the Plane.

[BibT_eX]

[DOI]

CoRR, 2015

On k-gons and k-holes in point sets.

[BibT_eX]

[DOI]

Hernán González-Aguilar

Comput. Geom., 2015

Reprint of: Theta-3 is connected.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position.

[BibT_eX]

[DOI]

Andrei Asinowski

Tillmann Miltzow

Electron. J. Comb., 2015

A Note on the Number of General 4-holes in (Perturbed) Grids.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Representing Directed Trees as Straight Skeletons.

[BibT_eX]

[DOI]

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

2014

Covering Folded Shapes.

[BibT_eX]

[DOI]

J. Comput. Geom., 2014

Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2014

Geodesic-Preserving Polygon Simplification.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2014

Plane Graphs with Parity Constraints.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Empty Monochromatic Simplices.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Shellable Drawings and the Cylindrical Crossing Number of Kn.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Reprint of: Extreme point and halving edge search in abstract order types.

[BibT_eX]

[DOI]

Tillmann Miltzow

Alexander Pilz

Comput. Geom., 2014

Lower bounds for the number of small convex k-holes.

[BibT_eX]

[DOI]

Comput. Geom., 2014

4-Holes in point sets.

[BibT_eX]

[DOI]

Hernán González-Aguilar

Comput. Geom., 2014

Theta-3 is connected.

[BibT_eX]

[DOI]

Comput. Geom., 2014

On k-convex point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Geodesic Order Types.

[BibT_eX]

[DOI]

Algorithmica, 2014

Reconstructing Point Set Order Typesfrom Radial Orderings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Order types and cross-sections of line arrangements in R^3.

[BibT_eX]

[DOI]

Andres J. Ruiz-Vargas

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Graph Drawings with Relative Edge Length Specifications.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Non-Shellable Drawings of Kn with Few Crossings.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Einführung in die angewandte Geometrie.

[BibT_eX]

[DOI]

Bert Jüttler

Mathematik Kompakt, Birkhäuser, ISBN: 978-3-0346-0143-6, 2014

2013

Balanced 6-holes in linearly separable bichromatic point sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

More on the crossing number of Kn: Monotone drawings.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

The 2-Page Crossing Number of Kn.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Extremal antipodal polygons and polytopes

[BibT_eX]

[DOI]

Luis Evaristo Caraballo

Carlos Ochoa

P. Nigsch

CoRR, 2013

Monotone Simultaneous Embedding of Directed Paths.

[BibT_eX]

[DOI]

CoRR, 2013

Shellable drawings and the cylindrical crossing number of $K_n$.

[BibT_eX]

[DOI]

CoRR, 2013

Extreme point and halving edge search in abstract order types.

[BibT_eX]

[DOI]

Tillmann Miltzow

Alexander Pilz

Comput. Geom., 2013

Blocking Delaunay triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Maximizing maximal angles for plane straight-line graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

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

2012

Pointed drawings of planar graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2012

On k-convex polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2012

What makes a Tree a Straight Skeleton?

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Computational and Structural Advantages of Circular Boundary Representation.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

There is a unique crossing-minimal rectilinear drawing of K18.

[BibT_eX]

[DOI]

Jesús Leaños

Electron. Notes Discret. Math., 2011

On 5-Gons and 5-Holes.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Convexifying Monotone Polygons while Maintaining Internal Visibility.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Convexifying Polygons Without Losing Visibilities.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Edge-Removal and Non-Crossing Configurations in Geometric Graphs.

[BibT_eX]

[DOI]

Sergio Cabello

Discret. Math. Theor. Comput. Sci., 2010

Divide-and-conquer for Voronoi diagrams revisited.

[BibT_eX]

[DOI]

Elisabeth Pilgerstorfer

Margot Rabl

Comput. Geom., 2010

Playing Pylos with an autonomous robot.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2010

Compatible pointed pseudo-triangulations.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Exact Medial Axis Computation for Circular Arc Boundaries.

[BibT_eX]

[DOI]

Proceedings of the Curves and Surfaces, 2010

Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics.

[BibT_eX]

[DOI]

Proceedings of the Curves and Surfaces, 2010

2009

Flip Graphs of Bounded-Degree Triangulations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

New results on lower bounds for the number of (<=k)-facets.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

Empty monochromatic triangles.

[BibT_eX]

[DOI]

Clemens Huemer

Comput. Geom., 2009

Compatible geometric matchings.

[BibT_eX]

[DOI]

Sergey Bereg

Adrian Dumitrescu

Alfredo García Olaverri

Comput. Geom., 2009

On minimum weight pseudo-triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Improved upper bounds on the reflexivity of point sets.

[BibT_eX]

[DOI]

Eyal Ackerman

Balázs Keszegh

Comput. Geom., 2009

Recovering Structure from r-Sampled Objects.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2009

Medial axis computation for planar free-form shapes.

[BibT_eX]

[DOI]

Comput. Aided Des., 2009

2008

On the number of pseudo-triangulations of certain point sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2008

Triangulations without pointed spanning trees.

[BibT_eX]

[DOI]

Clemens Huemer

Comput. Geom., 2008

Matching edges and faces in polygonal partitions.

[BibT_eX]

[DOI]

Comput. Geom., 2008

2007

Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles.

[BibT_eX]

[DOI]

Graphs Comb., 2007

On the Number of Plane Geometric Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Gray Code Enumeration of Plane Straight-Line Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2007

New results on lower bounds for the number of (k)-facets: (extended abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

Pre-Triangulations and Liftable Complexes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

Connecting colored point sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

A quadratic distance bound on sliding between crossing-free spanning trees.

[BibT_eX]

[DOI]

Klaus Reinhardt

Comput. Geom., 2007

Abstract order type extension and new results on the rectilinear crossing number.

[BibT_eX]

[DOI]

Comput. Geom., 2007

On (Pointed) Minimum Weight Pseudo-Triangulations.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Transforming spanning trees and pseudo-triangulations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

On the Crossing Number of Complete Graphs.

[BibT_eX]

[DOI]

Computing, 2006

On the number of plane graphs.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Games on triangulations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

On pseudo-convex decompositions, partitions, and coverings.

[BibT_eX]

[DOI]

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

2004

Quickest Paths, Straight Skeletons, and the City Voronoi Diagram.

[BibT_eX]

[DOI]

Belén Palop

Discret. Comput. Geom., 2004

A lower bound on the number of triangulations of planar point sets.

[BibT_eX]

[DOI]

Marc Noy

Comput. Geom., 2004

Convexity minimizes pseudo-triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2004

2003

Towards compatible triangulations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Pseudotriangulations from Surfaces and a Novel Type of Edge Flip.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Long proteins with unique optimal foldings in the H-P model.

[BibT_eX]

[DOI]

Comput. Geom., 2003

The Zigzag Path of a Pseudo-Triangulation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Spatial embedding of pseudo-triangulations.

[BibT_eX]

[DOI]

Peter Braay

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Degree Bounds for Constrained Pseudo-Triangulations.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Enumerating Order Types for Small Point Sets with Applications.

[BibT_eX]

[DOI]

Order, 2002

On Flips in Polyhedral Surfaces.

[BibT_eX]

[DOI]

Lyuba Alboul

Int. J. Found. Comput. Sci., 2002

Flipturning Polygons.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Discret. Comput. Geom., 2002

Sequences of spanning trees and a fixed tree theorem.

[BibT_eX]

[DOI]

Comput. Geom., 2002

Playing with Triangulations.

[BibT_eX]

[DOI]

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

2001

Generalized self-approaching curves.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Reconfiguring convex polygons.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Comput. Geom., 2001

Enumerating order types for small sets with applications.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

The point set order type data base: A collection of applications and results.

[BibT_eX]

[DOI]

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

On the number of triangulations every planar point set must have.

[BibT_eX]

[DOI]

Marc Noy

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

Edge Operations on Non-Crossing Spanning Trees.

[BibT_eX]

EuroCG, 2000

1999

New Results on MWT Subgraphs.

[BibT_eX]

[DOI]

Reinhard Hainz

Inf. Process. Lett., 1999

Skew Voronoi Diagrams.

[BibT_eX]

[DOI]

Evanthia Papadopoulou

Int. J. Comput. Geom. Appl., 1999

The Path of a Triangulation.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Constant-Level Greedy Triangulations Approximate the MWT Well.

[BibT_eX]

[DOI]

J. Comb. Optim., 1998

1997

Matching Shapes with a Reference Point.

[BibT_eX]

[DOI]

Helmut Alt

Günter Rote

Int. J. Comput. Geom. Appl., 1997

Voronoi Diagrams for Direction-Sensitive Distances.

[BibT_eX]

[DOI]

Evanthia Papadopoulou

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Classifying Hyperplanes in Hypercubes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

Triangulations Intersect Nicely.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1996

Straight Skeletons for General Polygonal Figures in the Plane.

[BibT_eX]

[DOI]