default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVictor Chepoi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j96]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
Two Simple but Efficient Algorithms to Recognize Robinson Dissimilarities. J. Classif. 41(3): 455-479 (2024)- [j95]Laurine Bénéteau, Jérémie Chalopin
, Victor Chepoi, Yann Vaxès:
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. Discret. Appl. Math. 359: 55-74 (2024) - [j94]Victor Chepoi, Kolja Knauer, Manon Philibert:
Labeled sample compression schemes for complexes of oriented matroids. J. Comput. Syst. Sci. 144: 103543 (2024) - [j93]Jérémie Chalopin, Victor Chepoi:
Boundary rigidity of CAT(0) cube complexes. J. Comb. Theory B 169: 352-366 (2024) - [j92]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Graphs with Gp-connected medians. Math. Program. 203(1): 369-420 (2024) - [j91]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
Modules in Robinson Spaces. SIAM J. Discret. Math. 38(1): 190-224 (2024) - [j90]Jérémie Chalopin, Manoj Changat, Victor Chepoi, Jeny Jacob:
First-order logic axiomatization of metric graph theory. Theor. Comput. Sci. 993: 114460 (2024) - [c30]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel:
Non-Clashing Teaching Maps for Balls in Graphs. COLT 2024: 840-875 - [i38]Victor Chepoi:
Separation axiom S3 for geodesic convexity in graphs. CoRR abs/2405.07512 (2024) - 2023
- [j89]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès:
Sample Compression Schemes for Balls in Graphs. SIAM J. Discret. Math. 37(4): 2585-2616 (2023) - [j88]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
A Simple and Optimal Algorithm for Strict Circular Seriation. SIAM J. Math. Data Sci. 5(1): 201-221 (2023) - [i37]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
Modules and PQ-trees in Robinson spaces. CoRR abs/2306.08800 (2023) - [i36]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel:
Non-Clashing Teaching Maps for Balls in Graphs. CoRR abs/2309.02876 (2023) - [i35]Jérémie Chalopin, Victor Chepoi:
Boundary rigidity of finite CAT(0) cube complexes. CoRR abs/2310.04223 (2023) - 2022
- [j87]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance labeling schemes for K4-free bridged graphs. Inf. Comput. 289(Part): 104959 (2022) - [j86]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Medians in median graphs and their cube complexes in linear time. J. Comput. Syst. Sci. 126: 80-105 (2022) - [j85]Jérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth:
Unlabeled sample compression schemes and corner peelings for ample and maximum classes. J. Comput. Syst. Sci. 127: 1-28 (2022) - [j84]Victor Chepoi, Kolja Knauer, Manon Philibert:
Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids. SIAM J. Discret. Math. 36(1): 509-535 (2022) - [c29]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès:
Sample Compression Schemes for Balls in Graphs. MFCS 2022: 31:1-31:14 - [i34]Jérémie Chalopin, Victor Chepoi, Ugo Giocanti:
Graphs with convex balls. CoRR abs/2201.01599 (2022) - [i33]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Graphs with Gp-connected medians. CoRR abs/2201.12248 (2022) - [i32]Jérémie Chalopin, Manoj Changat, Victor Chepoi, Jeny Jacob:
First-order logic axiomatization of metric graph theory. CoRR abs/2203.01070 (2022) - [i31]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
Modules in Robinson Spaces. CoRR abs/2203.12386 (2022) - [i30]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
A simple and optimal algorithm for strict circular seriation. CoRR abs/2205.04694 (2022) - [i29]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. CoRR abs/2206.03587 (2022) - [i28]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès:
Sample compression schemes for balls in graphs. CoRR abs/2206.13254 (2022) - 2021
- [j83]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance and Routing Labeling Schemes for Cube-Free Median Graphs. Algorithmica 83(1): 252-296 (2021) - [j82]Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès:
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. Discret. Comput. Geom. 65(3): 856-892 (2021) - [i27]Victor Chepoi, Kolja Knauer, Manon Philibert:
Labeled sample compression schemes for complexes of oriented matroids. CoRR abs/2110.15168 (2021) - 2020
- [j81]Victor Chepoi, Kolja Knauer, Manon Philibert:
Two-Dimensional Partial Cubes. Electron. J. Comb. 27(3): 3 (2020) - [j80]Victor Chepoi, Kolja Knauer, Tilen Marc:
Hypercellular graphs: Partial cubes without Q3- as partial cube minor. Discret. Math. 343(4): 111678 (2020) - [j79]Jérémie Chalopin, Victor Chepoi:
A counterexample to Thiagarajan's conjecture on regular event structures. J. Comput. Syst. Sci. 113: 76-100 (2020) - [j78]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
On density of subgraphs of Cartesian products. J. Graph Theory 93(1): 64-87 (2020) - [c28]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Medians in Median Graphs and Their Cube Complexes in Linear Time. ICALP 2020: 10:1-10:17 - [c27]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance Labeling Schemes for K4-Free Bridged Graphs. SIROCCO 2020: 310-327 - [i26]Victor Chepoi, Kolja Knauer, Manon Philibert:
Ample completions of OMs and CUOMs. CoRR abs/2007.12527 (2020) - [i25]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance labeling schemes for K4-free bridged graphs. CoRR abs/2007.14192 (2020)
2010 – 2019
- 2019
- [j77]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
On density of subgraphs of halved cubes. Eur. J. Comb. 80: 57-70 (2019) - [j76]Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed:
Fast approximation of eccentricities and distances in hyperbolic graphs. J. Graph Algorithms Appl. 23(2): 393-433 (2019) - [j75]Jérémie Chalopin, Victor Chepoi:
1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications. ACM Trans. Comput. Log. 20(3): 17:1-17:49 (2019) - [c26]Jérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth:
Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum Classes. ICALP 2019: 34:1-34:15 - [c25]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance Labeling Schemes for Cube-Free Median Graphs. MFCS 2019: 15:1-15:14 - [i24]Victor Chepoi, Kolja Knauer, Manon Philibert:
Two-dimensional partial cubes. CoRR abs/1906.04492 (2019) - [i23]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Medians in median graphs in linear time. CoRR abs/1907.10398 (2019) - 2018
- [j74]Hans-Jürgen Bandelt, Victor Chepoi, Kolja Knauer:
COMs: Complexes of oriented matroids. J. Comb. Theory A 156: 195-237 (2018) - [c24]Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed:
Fast Approximation of Centrality and Distances in Hyperbolic Graphs. COCOA 2018: 3-18 - [c23]Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès:
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. SoCG 2018: 22:1-22:15 - [i22]Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès:
Fast approximation and exact computation of negative curvature parameters of graphs. CoRR abs/1803.06324 (2018) - [i21]Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Al-Rasheed:
Fast approximation of centrality and distances in hyperbolic graphs. CoRR abs/1805.07232 (2018) - [i20]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance and routing labeling schemes for cube-free median graphs. CoRR abs/1809.10508 (2018) - [i19]Jérémie Chalopin, Victor Chepoi:
1-Safe Petri nets and special cube complexes: equivalence and applications. CoRR abs/1810.03395 (2018) - [i18]Jérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth:
Unlabeled sample compression schemes and corner peelings for ample and maximum classes. CoRR abs/1812.02099 (2018) - 2017
- [j73]Victor Chepoi:
Distance-Preserving Subgraphs of Johnson Graphs. Comb. 37(6): 1039-1055 (2017) - [j72]Victor Chepoi, Bertrand Estellon, Guyslain Naves:
Packing and Covering with Balls on Busemann Surfaces. Discret. Comput. Geom. 57(4): 985-1011 (2017) - [j71]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Bidirected minimum Manhattan network problem. Networks 69(2): 167-178 (2017) - [c22]Jérémie Chalopin, Victor Chepoi:
A Counterexample to Thiagarajan's Conjecture on Regular Event Structures. ICALP 2017: 101:1-101:14 - [c21]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Core congestion is inherent in hyperbolic networks. SODA 2017: 2264-2279 - [i17]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
On density of subgraphs of halved cubes. CoRR abs/1711.11414 (2017) - [i16]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
On density of subgraphs of Cartesian products. CoRR abs/1711.11485 (2017) - 2016
- [i15]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Core congestion is inherent in hyperbolic networks. CoRR abs/1605.03059 (2016) - [i14]Jérémie Chalopin, Victor Chepoi:
A counterexample to Thiagarajan's conjecture. CoRR abs/1605.08288 (2016) - [i13]Victor Chepoi, Kolja Knauer, Tilen Marc:
Partial cubes without $Q_3^-$ minors. CoRR abs/1606.02154 (2016) - 2015
- [j70]Jérémie Chalopin, Victor Chepoi, Guyslain Naves:
Isometric Embedding of Busemann Surfaces into L1. Discret. Comput. Geom. 53(1): 16-37 (2015) - [j69]Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein:
Ramified Rectilinear Polygons: Coordinatization by Dendrons. Discret. Comput. Geom. 54(4): 771-797 (2015) - [j68]Jérémie Chalopin, Victor Chepoi, Damian Osajda:
On two conjectures of Maurer concerning basis graphs of matroids. J. Comb. Theory B 114: 1-32 (2015) - [i12]Hans-Jürgen Bandelt, Victor Chepoi, Kolja Knauer:
COMs: Complexes of Oriented Matroids. CoRR abs/1507.06111 (2015) - [i11]Victor Chepoi, Bertrand Estellon, Guyslain Naves:
Packing and covering with balls on Busemann surfaces. CoRR abs/1508.00778 (2015) - 2014
- [j67]Jérémie Chalopin, Victor Chepoi, Panos Papasoglu, Timothée Pecatte:
Cop and Robber Game and Hyperbolicity. SIAM J. Discret. Math. 28(4): 1987-2007 (2014) - 2013
- [j66]Victor Chepoi, Daniela Maftuleac:
Shortest path problem in rectangular complexes of global nonpositive curvature. Comput. Geom. 46(1): 51-64 (2013) - [j65]Victor Chepoi, Stefan Felsner:
Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve. Comput. Geom. 46(9): 1036-1041 (2013) - [j64]Victor Chepoi, Mark F. Hagen:
On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes. J. Comb. Theory B 103(4): 428-467 (2013) - [j63]Bostjan Bresar, Jérémie Chalopin, Victor Chepoi, Matjaz Kovse, Arnaud Labourel, Yann Vaxès:
Retracts of Products of Chordal Graphs. J. Graph Theory 73(2): 161-180 (2013) - [i10]Jérémie Chalopin, Victor Chepoi, Guyslain Naves:
Isometric embedding of Busemann surfaces into L1. CoRR abs/1308.3181 (2013) - [i9]Jérémie Chalopin, Victor Chepoi, Panos Papasoglu, Timothée Pecatte:
Cop and robber game and hyperbolicity. CoRR abs/1308.3987 (2013) - 2012
- [j62]Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès:
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. Algorithmica 62(1-2): 146-168 (2012) - [j61]Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang:
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Algorithmica 62(3-4): 713-732 (2012) - [j60]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. Algorithmica 63(1-2): 551-567 (2012) - [j59]Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès:
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. Discret. Comput. Geom. 47(1): 187-214 (2012) - [j58]Victor Chepoi:
Nice Labeling Problem for Event Structures: A Counterexample. SIAM J. Comput. 41(4): 715-727 (2012) - [i8]Jérémie Chalopin, Victor Chepoi, Damian Osajda:
Proof of two Maurer's conjectures on basis graphs of matroids. CoRR abs/1212.6879 (2012) - 2011
- [j57]Victor Chepoi, Morgan Seston:
Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for l∞-Fitting Robinson Structures to Distances. Algorithmica 59(4): 521-568 (2011) - [j56]Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès:
Cop and Robber Games When the Robber Can Hide and Ride. SIAM J. Discret. Math. 25(1): 333-359 (2011) - [j55]Nicolas Catusse, Victor Chepoi, Yann Vaxès:
Embedding into the rectilinear plane in optimal O(n2) time. Theor. Comput. Sci. 412(22): 2425-2433 (2011) - [i7]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Bidirected minimum Manhattan network problem. CoRR abs/1107.1359 (2011) - 2010
- [j54]Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer:
The Helly property and satisfiability of Boolean formulas defined on set families. Eur. J. Comb. 31(2): 502-516 (2010) - [j53]Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann Vaxès:
Pareto Envelopes in Simple Polygons. Int. J. Comput. Geom. Appl. 20(6): 707-721 (2010) - [j52]Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein:
Combinatorics and Geometry of Finite and Infinite Squaregraphs. SIAM J. Discret. Math. 24(4): 1399-1440 (2010) - [c20]Nicolas Catusse, Victor Chepoi, Yann Vaxès:
Planar Hop Spanners for Unit Disk Graphs. ALGOSENSORS 2010: 16-30 - [c19]Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès:
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. APPROX-RANDOM 2010: 95-109 - [i6]Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès:
Cop and robber games when the robber can hide and ride. CoRR abs/1001.4457 (2010) - [i5]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm. CoRR abs/1004.5517 (2010) - [i4]Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès:
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs. CoRR abs/1007.0489 (2010) - [i3]Victor Chepoi, Daniela Maftuleac:
Shortest path problem in rectangular complexes of global nonpositive curvature. CoRR abs/1010.0852 (2010)
2000 – 2009
- 2009
- [j51]Victor Chepoi, Bernard Fichet, Morgan Seston:
Seriation in the Presence of Errors: NP-Hardness of l∞-Fitting Robinson Structures to Dissimilarity Matrices. J. Classif. 26(3): 279-296 (2009) - [c18]Victor Chepoi, Morgan Seston:
An Approximation Algorithm for linfinity Fitting Robinson Structures to Distances. STACS 2009: 265-276 - [i2]Victor Chepoi, Morgan Seston:
An Approximation Algorithm for l\infty-Fitting Robinson Structures to Distances. CoRR abs/0902.1261 (2009) - [i1]Nicolas Catusse, Victor Chepoi, Yann Vaxès:
Embedding into the rectilinear plane in optimal O*(n^2). CoRR abs/0910.1059 (2009) - 2008
- [j50]Hans-Jürgen Bandelt, Victor Chepoi:
The algebra of metric betweenness II: Geometry and equational characterization of weakly median graphs. Eur. J. Comb. 29(3): 676-700 (2008) - [j49]Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès:
Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. Electron. Notes Discret. Math. 31: 231-234 (2008) - [j48]Victor Chepoi, Karim Nouioua, Yann Vaxès:
A rounding algorithm for approximating minimum Manhattan networks. Theor. Comput. Sci. 390(1): 56-69 (2008) - [j47]Victor Chepoi, Bertrand Estellon, Yann Vaxès:
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length. Theor. Comput. Sci. 401(1-3): 131-143 (2008) - [c17]Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès:
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. SCG 2008: 59-68 - [c16]Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer:
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. ISMVL 2008: 100-105 - 2007
- [j46]Victor Chepoi, Bertrand Estellon, Yann Vaxès:
Covering Planar Graphs with a Fixed Number of Balls. Discret. Comput. Geom. 37(2): 237-244 (2007) - [j45]Hans-Jürgen Bandelt, Victor Chepoi:
The algebra of metric betweenness I: Subdirect representation and retraction. Eur. J. Comb. 28(6): 1640-1661 (2007) - [j44]Victor Chepoi:
Basis graphs of even Delta-matroids. J. Comb. Theory B 97(2): 175-192 (2007) - [c15]Victor Chepoi, Bertrand Estellon:
Packing and Covering delta -Hyperbolic Spaces by Balls. APPROX-RANDOM 2007: 59-73 - [c14]Victor Chepoi, Karim Nouioua:
Pareto envelopes in R3 under l1 and linfinity distance functions. SCG 2007: 284-293 - [c13]Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès:
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. SIROCCO 2007: 81-95 - 2006
- [j43]Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. Algorithmica 45(2): 209-226 (2006) - [j42]Hans-Jürgen Bandelt, Victor Chepoi, Andreas W. M. Dress, Jack H. Koolen:
Combinatorics of lopsided sets. Eur. J. Comb. 27(5): 669-689 (2006) - [j41]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Distance and routing labeling schemes for non-positively curved plane graphs. J. Algorithms 61(2): 60-88 (2006) - [j40]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Addressing, distances and routing in triangular systems with applications in cellular networks. Wirel. Networks 12(6): 671-679 (2006) - 2005
- [j39]Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
Mixed covering of trees and the augmentation problem with odd diameter constraints. Electron. Notes Discret. Math. 22: 405-408 (2005) - [j38]Victor Chepoi, Feodor F. Dragan, Chenyu Yan:
Additive sparse spanners for graphs with bounded length of largest induced cycle. Theor. Comput. Sci. 347(1-2): 54-75 (2005) - [c12]Victor Chepoi, Karim Nouioua, Yann Vaxès:
A Rounding Algorithm for Approximating Minimum Manhattan Networks. APPROX-RANDOM 2005: 40-51 - [c11]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Distance-Based Location Update and Routing in Irregular Cellular Networks. SNPD 2005: 380-387 - [c10]Victor Chepoi, Bertrand Estellon, Yann Vaxès:
Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length. WADS 2005: 282-293 - 2004
- [j37]Victor Chepoi, Clémentine Fanciullini, Yann Vaxès:
Median problem in some plane triangulations and quadrangulations. Comput. Geom. 27(3): 193-210 (2004) - [c9]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. IPDPS 2004 - 2003
- [j36]Victor Chepoi, Feodor F. Dragan:
Finding a central vertex in an HHD-free graph. Discret. Appl. Math. 131(1): 93-11 (2003) - [j35]Victor Chepoi, Yann Vaxès:
On covering bridged plane triangulations with balls. J. Graph Theory 44(1): 65-80 (2003) - [j34]Victor Chepoi, Hartmut Noltemeier, Yann Vaxès:
Upgrading trees under diameter and budget constraints. Networks 41(1): 24-35 (2003) - [j33]Hans-Jürgen Bandelt, Victor Chepoi:
1-Hyperbolic Graphs. SIAM J. Discret. Math. 16(2): 323-334 (2003) - [j32]Victor Chepoi, Alexis Rollin:
Interval routing in some planar networks. Theor. Comput. Sci. 290(3): 1503-1540 (2003) - [c8]Victor Chepoi, Feodor F. Dragan, Chenyu Yan:
Additive Spanners for k-Chordal Graphs. CIAC 2003: 96-107 - 2002
- [j31]Victor Chepoi, Yann Vaxès:
Augmenting Trees to Meet Biconnectivity and Diameter Constraints. Algorithmica 33(2): 243-262 (2002) - [j30]Hans-Jürgen Bandelt, Victor Chepoi:
Graphs with Connected Medians. SIAM J. Discret. Math. 15(2): 268-282 (2002) - [c7]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Center and diameter problems in plane triangulations and quadrangulations. SODA 2002: 346-355 - 2001
- [c6]Victor Chepoi, Alexis Rollin:
Interval Routing in Some Planar Quadrangulations. SIROCCO 2001: 89-104 - 2000
- [j29]Victor Chepoi:
Graphs of Some CAT(0) Complexes. Adv. Appl. Math. 24(2): 125-179 (2000) - [j28]Hans-Jürgen Bandelt, Victor Chepoi:
Decomposition andl1-Embedding of Weakly Median Graphs. Eur. J. Comb. 21(6): 701-714 (2000) - [j27]Hans-Jürgen Bandelt, Victor Chepoi, Alexander V. Karzanov:
A Characterization of Minimizable Metrics in the Multifacility Location Problem. Eur. J. Comb. 21(6): 715-725 (2000) - [j26]Victor Chepoi, Feodor F. Dragan:
A Note on Distance Approximating Trees in Graphs. Eur. J. Comb. 21(6): 761-766 (2000)
1990 – 1999
- 1999
- [j25]Victor Chepoi, Bernard Fichet:
Three-way Metrics: Axiomatization and Properties. Electron. Notes Discret. Math. 2: 150 (1999) - [j24]Victor Chepoi, Feodor F. Dragan:
A note on distance approximating trees in graphs. Electron. Notes Discret. Math. 3: 39 (1999) - [j23]Victor Chepoi, Dan Dumitrescu:
Fuzzy clustering with structural constraints. Fuzzy Sets Syst. 105(1): 91-97 (1999) - [j22]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Distance Approximating Trees for Chordal and Dually Chordal Graphs. J. Algorithms 30(1): 166-184 (1999) - 1998
- [j21]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. Discret. Appl. Math. 82(1-3): 43-77 (1998) - [j20]Hans-Jürgen Bandelt, Victor Chepoi, Monique Laurent:
Embedding into Rectilinear Spaces. Discret. Comput. Geom. 19(4): 595-604 (1998) - [j19]Victor Chepoi:
A note on r-dominating cliques. Discret. Math. 183(1-3): 47-60 (1998) - [j18]Victor Chepoi, Sandi Klavzar:
Distances in benzenoid systems: Further developments. Discret. Math. 192(1-3): 27-39 (1998) - [j17]Hans-Jürgen Bandelt, Victor Chepoi:
Embedding into the rectilinear grid. Networks 32(2): 127-132 (1998) - [j16]Victor Chepoi:
On Distance-Preserving and Domination Elimination Orderings. SIAM J. Discret. Math. 11(3): 414-436 (1998) - [j15]Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin:
Dually Chordal Graphs. SIAM J. Discret. Math. 11(3): 437-455 (1998) - 1997
- [j14]Victor Chepoi:
Peakless Functions on Graphs. Discret. Appl. Math. 73(2): 175-189 (1997) - [j13]Victor Chepoi, Michel Deza, Viatcheslav P. Grishukhin:
Clin D'oeil on L1-embeddable Planar Graphs. Discret. Appl. Math. 80(1): 3-19 (1997) - [j12]Victor Chepoi, Sandi Klavzar:
The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time. J. Chem. Inf. Comput. Sci. 37(4): 752-755 (1997) - [j11]Victor Chepoi:
Bridged Graphs Are Cop-Win Graphs: An Algorithmic Proof. J. Comb. Theory B 69(1): 97-100 (1997) - [j10]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. SIAM J. Discret. Math. 10(1): 109-127 (1997) - [c5]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). ESA 1997: 78-91 - 1996
- [j9]Victor Chepoi:
A Multifacility Location Problem on Median Spaces. Discret. Appl. Math. 64(1): 1-29 (1996) - [j8]Hans-Jürgen Bandelt, Victor Chepoi:
Embedding Metric Spaces in the Rectilinear Plane: a Six-Point Criterion. Discret. Comput. Geom. 15(1): 107-117 (1996) - [j7]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Perfect elimination orderings of chordal powers of graphs. Discret. Math. 158(1-3): 273-278 (1996) - [j6]Hans-Jürgen Bandelt, Victor Chepoi:
A Helly theorem in weakly modular space. Discret. Math. 160(1-3): 25-39 (1996) - [j5]Hans-Jürgen Bandelt, Victor Chepoi:
Graphs of Acyclic Cubical Complexes. Eur. J. Comb. 17(2-3): 113-120 (1996) - [j4]Hans-Jürgen Bandelt, Victor Chepoi:
Cellular Bipartite Graphs. Eur. J. Comb. 17(2-3): 121-134 (1996) - [j3]Victor Chepoi:
On Distances in Benzenoid Systems. J. Chem. Inf. Comput. Sci. 36(6): 1169-1172 (1996) - 1995
- [c4]Victor Chepoi, Feodor F. Dragan:
On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). FCT 1995: 181-190 - 1994
- [j2]Victor Chepoi, Feodor F. Dragan:
Computing a Median Point of a Simple Rectilinear Polygon. Inf. Process. Lett. 49(6): 281-285 (1994) - [c3]Victor Chepoi, Feodor F. Dragan:
A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. ESA 1994: 159-170 - [c2]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. WG 1994: 65-80 - 1993
- [j1]Victor Chepoi, Feodor F. Dragan:
On link diameter of a simple rectilinear polygon. Comput. Sci. J. Moldova 1(3): 62-74 (1993) - [c1]Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin:
Dually Chordal Graphs. WG 1993: 237-251
Coauthor Index
[j95] [j92] [j89] [j86] [c29] [i33] [i29] [i28] [j82] [c28] [j76] [i23] [c24] [c23] [i22] [i21] [j71] [c21] [i15] [j63] [j62] [j61] [j60] [j59] [j56] [j55] [i7] [j53] [c20] [c19] [i6] [i5] [i4] [i1] [j49] [j48] [j47] [c17] [j46] [c13] [j43] [j41] [j40] [j39] [c12] [c11] [c10] [j37] [c9] [j35] [j34] [j31] [c7]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
