The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Victor Chepoi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Victor Chepoi, Karim Nouioua, Yann Vaxès
    A Rounding Algorithm for Approximating Minimum Manhattan Networks. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:40-51 [Conf]
  2. Victor Chepoi, Feodor F. Dragan, Chenyu Yan
    Additive Spanners for k-Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:96-107 [Conf]
  3. Victor Chepoi, Karim Nouioua
    Pareto envelopes in R3 under l1 and linfinity distance functions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:284-293 [Conf]
  4. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
    Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:78-91 [Conf]
  5. Victor Chepoi, Feodor F. Dragan
    A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:159-170 [Conf]
  6. Victor Chepoi, Feodor F. Dragan
    On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:181-190 [Conf]
  7. Victor Chepoi, Feodor F. Dragan, Yann Vaxès
    Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  8. Victor Chepoi, Alexis Rollin
    Interval Routing in Some Planar Quadrangulations. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:89-104 [Conf]
  9. Victor Chepoi, Feodor F. Dragan, Yann Vaxès
    Distance-Based Location Update and Routing in Irregular Cellular Networks. [Citation Graph (0, 0)][DBLP]
    SNPD, 2005, pp:380-387 [Conf]
  10. Victor Chepoi, Feodor F. Dragan, Yann Vaxès
    Center and diameter problems in plane triangulations and quadrangulations. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:346-355 [Conf]
  11. Victor Chepoi, Bertrand Estellon, Yann Vaxès
    Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:282-293 [Conf]
  12. Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin
    Dually Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:237-251 [Conf]
  13. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
    The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:65-80 [Conf]
  14. Victor Chepoi, Yann Vaxès
    Augmenting Trees to Meet Biconnectivity and Diameter Constraints. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:2, pp:243-262 [Journal]
  15. Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès
    Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:209-226 [Journal]
  16. Victor Chepoi, Clémentine Fanciullini, Yann Vaxès
    Median problem in some plane triangulations and quadrangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:3, pp:193-210 [Journal]
  17. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
    The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:43-77 [Journal]
  18. Victor Chepoi
    A Multifacility Location Problem on Median Spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:64, n:1, pp:1-29 [Journal]
  19. Victor Chepoi
    Peakless Functions on Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:73, n:2, pp:175-189 [Journal]
  20. Victor Chepoi, Feodor F. Dragan
    Finding a central vertex in an HHD-free graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:93-11 [Journal]
  21. Victor Chepoi, Michel Deza, Viatcheslav P. Grishukhin
    Clin D'oeil on L1-embeddable Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:80, n:1, pp:3-19 [Journal]
  22. Hans-Jürgen Bandelt, Victor Chepoi
    Embedding Metric Spaces in the Rectilinear Plane: a Six-Point Criterion. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:15, n:1, pp:107-117 [Journal]
  23. Hans-Jürgen Bandelt, Victor Chepoi, Monique Laurent
    Embedding into Rectilinear Spaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:4, pp:595-604 [Journal]
  24. Hans-Jürgen Bandelt, Victor Chepoi, Alexander V. Karzanov
    A Characterization of Minimizable Metrics in the Multifacility Location Problem. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:6, pp:715-725 [Journal]
  25. Hans-Jürgen Bandelt, Victor Chepoi
    Decomposition andl1-Embedding of Weakly Median Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:6, pp:701-714 [Journal]
  26. Hans-Jürgen Bandelt, Victor Chepoi
    Graphs of Acyclic Cubical Complexes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:113-120 [Journal]
  27. Hans-Jürgen Bandelt, Victor Chepoi
    Cellular Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:121-134 [Journal]
  28. Hans-Jürgen Bandelt, Victor Chepoi, Andreas W. M. Dress, Jack H. Koolen
    Combinatorics of lopsided sets. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:5, pp:669-689 [Journal]
  29. Victor Chepoi, Feodor F. Dragan
    A Note on Distance Approximating Trees in Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:6, pp:761-766 [Journal]
  30. Victor Chepoi, Feodor F. Dragan
    Computing a Median Point of a Simple Rectilinear Polygon. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:6, pp:281-285 [Journal]
  31. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
    Distance Approximating Trees for Chordal and Dually Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:30, n:1, pp:166-184 [Journal]
  32. Victor Chepoi, Feodor F. Dragan, Yann Vaxès
    Distance and routing labeling schemes for non-positively curved plane graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:61, n:2, pp:60-88 [Journal]
  33. Victor Chepoi
    On Distances in Benzenoid Systems. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1996, v:36, n:6, pp:1169-1172 [Journal]
  34. Victor Chepoi, Sandi Klavzar
    The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1997, v:37, n:4, pp:752-755 [Journal]
  35. Victor Chepoi
    Bridged Graphs Are Cop-Win Graphs: An Algorithmic Proof. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:69, n:1, pp:97-100 [Journal]
  36. Victor Chepoi
    Basis graphs of even Delta-matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:2, pp:175-192 [Journal]
  37. Victor Chepoi, Hartmut Noltemeier, Yann Vaxès
    Upgrading trees under diameter and budget constraints. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:1, pp:24-35 [Journal]
  38. Hans-Jürgen Bandelt, Victor Chepoi
    Embedding into the rectilinear grid. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:2, pp:127-132 [Journal]
  39. Hans-Jürgen Bandelt, Victor Chepoi
    1-Hyperbolic Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:2, pp:323-334 [Journal]
  40. Hans-Jürgen Bandelt, Victor Chepoi
    Graphs with Connected Medians. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:268-282 [Journal]
  41. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
    Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:1, pp:109-127 [Journal]
  42. Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin
    Dually Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:3, pp:437-455 [Journal]
  43. Victor Chepoi
    On Distance-Preserving and Domination Elimination Orderings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:3, pp:414-436 [Journal]
  44. Victor Chepoi, Feodor F. Dragan, Chenyu Yan
    Additive sparse spanners for graphs with bounded length of largest induced cycle. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:54-75 [Journal]
  45. Victor Chepoi, Alexis Rollin
    Interval routing in some planar networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1503-1540 [Journal]
  46. Victor Chepoi, Bertrand Estellon
    Packing and Covering delta -Hyperbolic Spaces by Balls. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:59-73 [Conf]
  47. Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès
    A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:81-95 [Conf]
  48. Victor Chepoi, Bertrand Estellon, Yann Vaxès
    Covering Planar Graphs with a Fixed Number of Balls. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:2, pp:237-244 [Journal]
  49. Victor Chepoi, Sandi Klavzar
    Distances in benzenoid systems: Further developments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:192, n:1-3, pp:27-39 [Journal]
  50. Victor Chepoi
    A note on r-dominating cliques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:183, n:1-3, pp:47-60 [Journal]
  51. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
    Perfect elimination orderings of chordal powers of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:158, n:1-3, pp:273-278 [Journal]
  52. Hans-Jürgen Bandelt, Victor Chepoi
    A Helly theorem in weakly modular space. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:25-39 [Journal]
  53. Victor Chepoi, Feodor F. Dragan, Yann Vaxès
    Addressing, distances and routing in triangular systems with applications in cellular networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2006, v:12, n:6, pp:671-679 [Journal]

  54. Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. [Citation Graph (, )][DBLP]


  55. Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. [Citation Graph (, )][DBLP]


  56. Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. [Citation Graph (, )][DBLP]


  57. An Approximation Algorithm for linfinity Fitting Robinson Structures to Distances. [Citation Graph (, )][DBLP]


  58. An Approximation Algorithm for l\infty-Fitting Robinson Structures to Distances [Citation Graph (, )][DBLP]


  59. Embedding into the rectilinear plane in optimal O*(n^2) [Citation Graph (, )][DBLP]


  60. Cop and robber games when the robber can hide and ride [Citation Graph (, )][DBLP]


  61. Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs [Citation Graph (, )][DBLP]


  62. The algebra of metric betweenness I: Subdirect representation and retraction. [Citation Graph (, )][DBLP]


  63. The algebra of metric betweenness II: Geometry and equational characterization of weakly median graphs. [Citation Graph (, )][DBLP]


  64. The Helly property and satisfiability of Boolean formulas defined on set families. [Citation Graph (, )][DBLP]


Search in 0.202secs, Finished in 0.206secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002