Victor Chepoi

CoRR, 2023

Non-Clashing Teaching Maps for Balls in Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Modules and PQ-trees in Robinson spaces.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Unlabeled sample compression schemes and corner peelings for ample and maximum classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Medians in median graphs and their cube complexes in linear time.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Distance labeling schemes for K4-free bridged graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2022

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G2-connected medians.

[BibT_eX]

[DOI]

CoRR, 2022

First-order logic axiomatization of metric graph theory.

[BibT_eX]

[DOI]

CoRR, 2022

Graphs with convex balls.

[BibT_eX]

[DOI]

Ugo Giocanti

CoRR, 2022

2021

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

Labeled sample compression schemes for complexes of oriented matroids.

[BibT_eX]

[DOI]

CoRR, 2021

Distance and Routing Labeling Schemes for Cube-Free Median Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

On density of subgraphs of Cartesian products.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

A counterexample to Thiagarajan's conjecture on regular event structures.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Hypercellular graphs: Partial cubes without Q3- as partial cube minor.

[BibT_eX]

[DOI]

Tilen Marc

Discret. Math., 2020

Ample completions of OMs and CUOMs.

[BibT_eX]

[DOI]

CoRR, 2020

Two-Dimensional Partial Cubes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Distance Labeling Schemes for K4-Free Bridged Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2020

2019

1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2019

Fast approximation of eccentricities and distances in hyperbolic graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

On density of subgraphs of halved cubes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Medians in median graphs in linear time.

[BibT_eX]

[DOI]

CoRR, 2019

Distance Labeling Schemes for Cube-Free Median Graphs.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

COMs: Complexes of oriented matroids.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2018

Fast Approximation of Centrality and Distances in Hyperbolic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Bidirected minimum Manhattan network problem.

[BibT_eX]

[DOI]

Networks, 2017

Packing and Covering with Balls on Busemann Surfaces.

[BibT_eX]

[DOI]

Guyslain Naves

Discret. Comput. Geom., 2017

Distance-Preserving Subgraphs of Johnson Graphs.

[BibT_eX]

[DOI]

Comb., 2017

Core congestion is inherent in hyperbolic networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Partial cubes without $Q_3^-$ minors.

[BibT_eX]

[DOI]

Tilen Marc

CoRR, 2016

A counterexample to Thiagarajan's conjecture.

[BibT_eX]

[DOI]

CoRR, 2016

2015

On two conjectures of Maurer concerning basis graphs of matroids.

[BibT_eX]

[DOI]

Damian Osajda

J. Comb. Theory, Ser. B, 2015

Isometric Embedding of Busemann Surfaces into L1.

[BibT_eX]

[DOI]

Guyslain Naves

Discret. Comput. Geom., 2015

Ramified Rectilinear Polygons: Coordinatization by Dendrons.

[BibT_eX]

[DOI]

David Eppstein

Discret. Comput. Geom., 2015

2014

Cop and Robber Game and Hyperbolicity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

2013

Retracts of Products of Chordal Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes.

[BibT_eX]

[DOI]

Mark F. Hagen

J. Comb. Theory, Ser. B, 2013

Shortest path problem in rectangular complexes of global nonpositive curvature.

[BibT_eX]

[DOI]

Daniela Maftuleac

Comput. Geom., 2013

Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve.

[BibT_eX]

[DOI]

Stefan Felsner

Comput. Geom., 2013

2012

Nice Labeling Problem for Event Structures: A Counterexample.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

Proof of two Maurer's conjectures on basis graphs of matroids

[BibT_eX]

[DOI]

Damian Osajda

CoRR, 2012

A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives.

[BibT_eX]

[DOI]

Algorithmica, 2012

Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2012

Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2012

2011

Embedding into the rectilinear plane in optimal O(n2) time.

[BibT_eX]

[DOI]

Nicolas Catusse

Theor. Comput. Sci., 2011

Cop and Robber Games When the Robber Can Hide and Ride.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for l∞-Fitting Robinson Structures to Distances.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

Combinatorics and Geometry of Finite and Infinite Squaregraphs.

[BibT_eX]

[DOI]

David Eppstein

SIAM J. Discret. Math., 2010

Pareto Envelopes in Simple Polygons.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

The Helly property and satisfiability of Boolean formulas defined on set families.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

Planar Hop Spanners for Unit Disk Graphs.

[BibT_eX]

[DOI]

Nicolas Catusse

Proceedings of the Algorithms for Sensor Systems, 2010

2009

Embedding into the rectilinear plane in optimal O*(n^2)

[BibT_eX]

[DOI]

Nicolas Catusse

CoRR, 2009

An Approximation Algorithm for l\infty-Fitting Robinson Structures to Distances

[BibT_eX]

[DOI]

CoRR, 2009

Seriation in the Presence of Errors: NP-Hardness of l∞-Fitting Robinson Structures to Dissimilarity Matrices.

[BibT_eX]

[DOI]

Bernard Fichet

J. Classif., 2009

An Approximation Algorithm for linfinity Fitting Robinson Structures to Distances.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008

A rounding algorithm for approximating minimum Manhattan networks.

[BibT_eX]

[DOI]

Karim Nouioua

Theor. Comput. Sci., 2008

Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

The algebra of metric betweenness II: Geometry and equational characterization of weakly median graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 2008

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Basis graphs of even Delta-matroids.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2007

The algebra of metric betweenness I: Subdirect representation and retraction.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Covering Planar Graphs with a Fixed Number of Balls.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

Pareto envelopes in R3 under l1 and linfinity distance functions.

[BibT_eX]

[DOI]

Karim Nouioua

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

Packing and Covering delta -Hyperbolic Spaces by Balls.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2007

2006

Addressing, distances and routing in triangular systems with applications in cellular networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2006

Distance and routing labeling schemes for non-positively curved plane graphs.

[BibT_eX]

[DOI]

J. Algorithms, 2006

Combinatorics of lopsided sets.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

2005

Additive sparse spanners for graphs with bounded length of largest induced cycle.

[BibT_eX]

[DOI]

Chenyu Yan

Theor. Comput. Sci., 2005

Mixed covering of trees and the augmentation problem with odd diameter constraints.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Distance-Based Location Update and Routing in Irregular Cellular Networks.

[BibT_eX]

[DOI]

Proceedings of the 6th ACIS International Conference on Software Engineering, 2005

2004

Median problem in some plane triangulations and quadrangulations.

[BibT_eX]

[DOI]

Clémentine Fanciullini

Comput. Geom., 2004

Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

Interval routing in some planar networks.

[BibT_eX]

[DOI]

Alexis Rollin

Theor. Comput. Sci., 2003

1-Hyperbolic Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Upgrading trees under diameter and budget constraints.

[BibT_eX]

[DOI]

Hartmut Noltemeier

Networks, 2003

On covering bridged plane triangulations with balls.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Finding a central vertex in an HHD-free graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Additive Spanners for k-Chordal Graphs.

[BibT_eX]

[DOI]

Chenyu Yan

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Graphs with Connected Medians.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

Augmenting Trees to Meet Biconnectivity and Diameter Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2002

Center and diameter problems in plane triangulations and quadrangulations.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Interval Routing in Some Planar Quadrangulations.

[BibT_eX]

Alexis Rollin

Proceedings of the SIROCCO 8, 2001

2000

A Characterization of Minimizable Metrics in the Multifacility Location Problem.

[BibT_eX]

[DOI]

Alexander V. Karzanov

Eur. J. Comb., 2000

Decomposition andl1-Embedding of Weakly Median Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2000

Graphs of Some CAT(0) Complexes.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2000

1999

Distance Approximating Trees for Chordal and Dually Chordal Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Fuzzy clustering with structural constraints.

[BibT_eX]

[DOI]

Dan Dumitrescu

Fuzzy Sets Syst., 1999

Three-way Metrics: Axiomatization and Properties.

[BibT_eX]

[DOI]

Bernard Fichet

Electron. Notes Discret. Math., 1999

A note on distance approximating trees in graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

1998

On Distance-Preserving and Domination Elimination Orderings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

Dually Chordal Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

Embedding into the rectilinear grid.

[BibT_eX]

[DOI]

Networks, 1998

Distances in benzenoid systems: Further developments.

[BibT_eX]

[DOI]

Sandi Klavzar

Discret. Math., 1998

A note on r-dominating cliques.

[BibT_eX]

[DOI]

Discret. Math., 1998

Embedding into Rectilinear Spaces.

[BibT_eX]

[DOI]

Monique Laurent

Discret. Comput. Geom., 1998

The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1997

Bridged Graphs Are Cop-Win Graphs: An Algorithmic Proof.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1997

The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time.

[BibT_eX]

[DOI]

Sandi Klavzar

J. Chem. Inf. Comput. Sci., 1997

Clin D'oeil on L1-embeddable Planar Graphs.

[BibT_eX]

[DOI]

Viatcheslav P. Grishukhin

Michel Deza

Discret. Appl. Math., 1997

Peakless Functions on Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

On Distances in Benzenoid Systems.

[BibT_eX]

[DOI]

J. Chem. Inf. Comput. Sci., 1996

Cellular Bipartite Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1996

Graphs of Acyclic Cubical Complexes.

[BibT_eX]

[DOI]

Eur. J. Comb., 1996

Perfect elimination orderings of chordal powers of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

A Helly theorem in weakly modular space.

[BibT_eX]

[DOI]

Discret. Math., 1996

Embedding Metric Spaces in the Rectilinear Plane: a Six-Point Criterion.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1996

A Multifacility Location Problem on Median Spaces.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

1995

On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

Computing a Median Point of a Simple Rectilinear Polygon.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

On link diameter of a simple rectilinear polygon.

[BibT_eX]

[DOI]