


default search action
Michel Habib
Person information
- affiliation: University Paris Diderot, France
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [c47]Pierre Bergé, Guillaume Ducoffe, Michel Habib:
Quasilinear-time eccentricities computation, and more, on median graphs. SODA 2025: 1679-1704 - [c46]Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. SODA 2025: 2157-2193 - 2024
- [j78]Meirun Chen, Michel Habib, Cheng-Kuan Lin:
A novel edge connectivity based on edge partition for hypercube and folded hypercube. Appl. Math. Comput. 470: 128558 (2024) - [j77]Pierre Bergé, Guillaume Ducoffe, Michel Habib:
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs. Theory Comput. Syst. 68(1): 144-193 (2024) - [j76]Jérémie Dusart, Michel Habib
, Derek G. Corneil:
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications. Order 41(1): 99-133 (2024) - [j75]Michel Habib, Lalla Mouatadid
, Éric Sopena, Mengchuan Zou:
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs. SIAM J. Discret. Math. 38(1): 566-589 (2024) - [i33]Pierre Bergé, Guillaume Ducoffe, Michel Habib:
Quasilinear-time eccentricities computation, and more, on median graphs. CoRR abs/2410.10235 (2024) - [i32]Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Bow Metrics and Hyperbolicity. CoRR abs/2411.16548 (2024) - 2023
- [j74]Pierre Charbit, Michel Habib, Lalla Mouatadid
, Reza Naserasr
:
A new graph parameter to measure linearity. J. Graph Theory 103(3): 462-485 (2023) - [j73]Meirun Chen, Michel Habib, Cheng-Kuan Lin
:
Diagnosability for a family of matching composition networks. J. Supercomput. 79(7): 7584-7608 (2023) - [c45]Michel Habib, Minh-Hang Nguyen, Mikaël Rabie, Laurent Viennot:
Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor. SSS 2023: 344-358 - [i31]Michel Habib, Minh-Hang Nguyen, Mikaël Rabie, Laurent Viennot:
Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor. CoRR abs/2302.07666 (2023) - [i30]Guillaume Ducoffe, Laurent Feuilloley, Michel Habib, François Pitois:
Pattern detection in ordered graphs. CoRR abs/2302.11619 (2023) - 2022
- [j72]Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension. SIAM J. Comput. 51(5): 1506-1534 (2022) - [j71]Hong Chen
, Meirun Chen, Michel Habib, Cheng-Kuan Lin:
Connectivity for some families of composition networks. Theor. Comput. Sci. 922: 361-367 (2022) - [j70]Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou:
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs. Theor. Comput. Sci. 923: 56-73 (2022) - [c44]Abderaouf Gacem, Mohammed Haddad, Hamida Seba, Gaétan Berthe
, Michel Habib:
Guiding Random Walks by Effective Resistance for Effective Node Embedding. ICPRAI (1) 2022: 665-676 - [c43]Pierre Bergé, Guillaume Ducoffe, Michel Habib:
Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs. STACS 2022: 9:1-9:21 - 2021
- [j69]Guillaume Ducoffe, Michel Habib
, Laurent Viennot:
Fast Diameter Computation within Split Graphs. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - [j68]Jérémie Dusart
, Derek G. Corneil, Michel Habib:
Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. SIAM J. Comput. 50(3): 1148-1153 (2021) - [j67]Laurent Feuilloley
, Michel Habib:
Graph Classes and Forbidden Patterns on Three Vertices. SIAM J. Discret. Math. 35(1): 55-90 (2021) - [c42]Pierre Bergé, Michel Habib:
Diameter in linear time for constant-dimension median graphs. LAGOS 2021: 97-107 - [i29]Michel Habib, Lalla Mouatadid, Éric Sopena, Mengchuan Zou:
(α, β)-Modules in Graphs. CoRR abs/2101.08881 (2021) - [i28]Pierre Bergé, Michel Habib:
Diameter, radius and all eccentricities in linear time for constant-dimension median graphs. CoRR abs/2105.12150 (2021) - [i27]Pierre Bergé, Guillaume Ducoffe, Michel Habib:
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs. CoRR abs/2110.02709 (2021) - [i26]Laurent Feuilloley, Michel Habib:
Classifying grounded intersection graphs via ordered forbidden patterns. CoRR abs/2112.00629 (2021) - 2020
- [j66]Michel Habib, Lalla Mouatadid
:
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. Algorithmica 82(2): 260-278 (2020) - [c41]Michel Habib, Lalla Mouatadid, Mengchuan Zou:
Approximating Modular Decomposition Is Hard. CALDAM 2020: 53-66 - [c40]Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. SODA 2020: 1905-1922
2010 – 2019
- 2019
- [j65]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) - [j64]Omid Etesami, Narges Ghareghani, Michel Habib
, Mohammad Reza Hooshmandasl
, Reza Naserasr, Pouyeh Sharifani:
When an optimal dominating set with given constraints exists. Theor. Comput. Sci. 780: 54-65 (2019) - [c39]Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Fast Diameter Computation Within Split Graphs. COCOA 2019: 155-167 - [c38]Michel Habib
, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou:
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. IWOCA 2019: 251-264 - [i25]Guillaume Ducoffe, Michel Habib
, Laurent Viennot:
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. CoRR abs/1907.04385 (2019) - [i24]Guillaume Ducoffe, Michel Habib
, Laurent Viennot:
Fast Diameter Computation within Split Graphs. CoRR abs/1910.03438 (2019) - 2018
- [j63]Michel Habib
, Lhouari Nourine:
Representation of lattices via set-colored posets. Discret. Appl. Math. 249: 64-73 (2018) - [c37]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 - [i23]Feodor F. Dragan, Michel Habib
, Laurent Viennot:
Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates. CoRR abs/1803.04660 (2018) - [i22]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) - [i21]Laurent Feuilloley
, Michel Habib
:
Graph classes and forbidden patterns on three vertices. CoRR abs/1812.05913 (2018) - 2017
- [j62]Jérémie Dusart, Michel Habib
:
A new LBFS-based algorithm for cocomparability graph recognition. Discret. Appl. Math. 216: 149-161 (2017) - [c36]Pierre Charbit
, Michel Habib
, Lalla Mouatadid, Reza Naserasr:
A New Graph Parameter to Measure Linearity. COCOA (2) 2017: 154-168 - [c35]Michel Habib
, Lalla Mouatadid:
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. ISAAC 2017: 43:1-43:12 - [i20]Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr:
Towards A Unified View of Linear Structure on Graph Classes. CoRR abs/1702.02133 (2017) - [i19]Michel Habib, Lalla Mouatadid:
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. CoRR abs/1707.01245 (2017) - 2016
- [j61]Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien de Montgolfier:
A tie-break model for graph search. Discret. Appl. Math. 199: 89-100 (2016) - [j60]Vincent Cohen-Addad
, Michel Habib
, Fabien de Montgolfier:
Algorithmic aspects of switch cographs. Discret. Appl. Math. 200: 23-42 (2016) - [j59]Mourad Baïou, Michel Habib, Lhouari Nourine:
Preface. RAIRO Oper. Res. 50(2): 221-222 (2016) - [j58]Derek G. Corneil, Jérémie Dusart, Michel Habib, Ekkehard Köhler:
On the Power of Graph Searching for Cocomparability Graphs. SIAM J. Discret. Math. 30(1): 569-591 (2016) - [r1]Derek G. Corneil, Michel Habib:
Unified View of Graph Searching and LDFS-Based Certifying Algorithms. Encyclopedia of Algorithms 2016: 2291-2297 - [i18]Finn Völkel, Eric Bapteste, Michel Habib
, Philippe Lopez, Chloe Vigliotti:
Read networks and k-laminar graphs. CoRR abs/1603.01179 (2016) - [i17]Jérémie Dusart, Michel Habib
, Derek G. Corneil:
Maximal cliques structure for cocomparability graphs and applications. CoRR abs/1611.02002 (2016) - 2015
- [j57]Michele Borassi
, Pierluigi Crescenzi
, Michel Habib
, Walter A. Kosters, Andrea Marino
, Frank W. Takes
:
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. Theor. Comput. Sci. 586: 59-80 (2015) - [c34]Michele Borassi, Pierluigi Crescenzi
, Michel Habib
:
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems. ICTCS 2015: 51-67 - [i16]Derek G. Corneil, Jérémie Dusart, Michel Habib, Fabien de Montgolfier:
A tie-break model for graph search. CoRR abs/1501.06148 (2015) - 2014
- [j56]Michel Habib
, Antoine Mamcarz, Fabien de Montgolfier:
Computing H-Joins with Application to 2-Modular Decomposition. Algorithmica 70(2): 245-266 (2014) - [j55]Pierre Charbit
, Michel Habib
, Antoine Mamcarz:
Influence of the tie-break rule on the end-vertex problem. Discret. Math. Theor. Comput. Sci. 16(2): 57-72 (2014) - [c33]Michele Borassi, Pierluigi Crescenzi
, Michel Habib, Walter A. Kosters, Andrea Marino
, Frank W. Takes
:
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. FUN 2014: 52-63 - [c32]Michel Habib, Antoine Mamcarz:
Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs. WG 2014: 263-274 - [i15]Michele Borassi, Pierluigi Crescenzi, Michel Habib:
Into the Square - On the Complexity of Quadratic-Time Solvable Problems. CoRR abs/1407.4972 (2014) - 2013
- [j54]Adriana P. Figueiredo, Michel Habib, Sulamita Klein, Jayme Luiz Szwarcfiter:
The Arboreal Jump Number of an Order. Order 30(1): 339-350 (2013) - [j53]Derek G. Corneil, Barnaby Dalton, Michel Habib
:
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. SIAM J. Comput. 42(3): 792-807 (2013) - [j52]Michel Habib, Juraj Stacho:
Unique perfect phylogeny is intractable. Theor. Comput. Sci. 476: 47-66 (2013) - [j51]Pilu Crescenzi
, Roberto Grossi, Michel Habib
, Leonardo Lanzi, Andrea Marino
:
On computing the diameter of real-world undirected graphs. Theor. Comput. Sci. 514: 84-95 (2013) - [i14]Ismael Belghiti, Michel Habib:
A general method for common intervals. CoRR abs/1309.7141 (2013) - [i13]Vincent Cohen-Addad, Michel Habib
, Fabien de Montgolfier:
Algorithmic Aspects of Switch Cographs. CoRR abs/1310.1012 (2013) - 2012
- [j50]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) - [j49]Derek G. Corneil, Michel Habib
, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics:
Polynomial-time recognition of clique-width ≤3 graphs. Discret. Appl. Math. 160(6): 834-865 (2012) - [j48]Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao:
Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. 33(5): 688-711 (2012) - [j47]Michel Habib, Juraj Stacho:
Reduced clique graphs of chordal graphs. Eur. J. Comb. 33(5): 712-735 (2012) - [j46]Michel Habib, Thu-Hien To:
Constructing a Minimum phylogenetic Network from a Dense triplet Set. J. Bioinform. Comput. Biol. 10(5) (2012) - [j45]Pierre Charbit
, Michel Habib, Nicolas Trotignon, Kristina Vuskovic:
Detecting 2-joins faster. J. Discrete Algorithms 17: 60-66 (2012) - [c31]Michel Habib, Antoine Mamcarz, Fabien de Montgolfier:
Algorithms for Some H-Join Decompositions. LATIN 2012: 446-457 - 2011
- [j44]Arnaud Durand, Michel Habib:
Complexity issues for the sandwich homogeneous set problem. Discret. Appl. Math. 159(7): 574-580 (2011) - [c30]Michel Habib, Juraj Stacho:
Unique Perfect Phylogeny Is NP-Hard. CPM 2011: 132-146 - [c29]Michel Habib, Thu-Hien To:
On a Conjecture about Compatibility of Multi-states Characters. WABI 2011: 116-127 - [i12]Michel Habib, Thu-Hien To:
On a conjecture of compatibility of multi-states characters. CoRR abs/1105.1109 (2011) - [i11]Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic:
Detecting 2-joins faster. CoRR abs/1107.3977 (2011) - 2010
- [j43]Michel Habib
, Christophe Paul
:
A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1): 41-59 (2010) - [e3]Christophe Paul, Michel Habib:
Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers. Lecture Notes in Computer Science 5911, 2010, ISBN 978-3-642-11408-3 [contents] - [i10]Michel Habib, Juraj Stacho:
Unique perfect phylogeny is NP-hard. CoRR abs/1011.5737 (2010) - [i9]Michel Habib, Thu-Hien To:
Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic Networks in Polynomial Time. CoRR abs/1012.4084 (2010)
2000 – 2009
- 2009
- [j42]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Algorithmic aspects of a general modular decomposition theory. Discret. Appl. Math. 157(9): 1993-2009 (2009) - [j41]Michel Habib, Juraj Stacho:
Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage. Electron. Notes Discret. Math. 32: 99-108 (2009) - [j40]Michel Habib, Vincent Limouzy:
On some simplicial elimination schemes for chordal graphs. Electron. Notes Discret. Math. 32: 125-132 (2009) - [j39]Binh-Minh Bui-Xuan, Michel Habib
:
Unifying the representation of symmetric crossing families and weakly partitive families. Electron. Notes Discret. Math. 34: 329-333 (2009) - [j38]Michel Habib, Juraj Stacho:
A Decomposition Theorem for Chordal Graphs and its Applications. Electron. Notes Discret. Math. 34: 561-565 (2009) - [c28]Michel Habib:
Diameter and Center Computations in Networks. CTW 2009: 257-258 - [c27]Thu-Hien To, Michel Habib:
Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time. CPM 2009: 275-288 - [c26]Michel Habib, Juraj Stacho:
Polynomial-Time Algorithm for the Leafage of Chordal Graphs. ESA 2009: 290-300 - [i8]Michel Habib
, Vincent Limouzy:
On some simplicial elimination schemes for chordal graphs. CoRR abs/0901.2645 (2009) - [i7]Clémence Magnien, Matthieu Latapy, Michel Habib:
Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs. CoRR abs/0904.2728 (2009) - [i6]Michel Habib, Christophe Paul:
A survey on algorithmic aspects of modular decomposition. CoRR abs/0912.1457 (2009) - 2008
- [j37]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) - [j36]Pierre Charbit
, Michel Habib
, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao:
A note on computing set overlap classes. Inf. Process. Lett. 108(4): 186-191 (2008) - [j35]Clémence Magnien, Matthieu Latapy, Michel Habib:
Fast computation of empirically tight bounds for the diameter of massive graphs. ACM J. Exp. Algorithmics 13 (2008) - [j34]Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
:
A Simple Linear Time LexBFS Cograph Recognition Algorithm. SIAM J. Discret. Math. 22(4): 1277-1296 (2008) - [j33]Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
:
Competitive graph searches. Theor. Comput. Sci. 393(1-3): 72-80 (2008) - [c25]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 - [c24]Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
:
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. ICALP (1) 2008: 634-645 - [c23]Binh-Minh Bui-Xuan, Michel Habib
:
A Representation Theorem for Union-Difference Families and Application. LATIN 2008: 492-503 - 2007
- [j32]Michel Habib
, David Kelly, Emmanuelle Lebhar, Christophe Paul
:
Can transitive orientation make sandwich problems easier? Discret. Math. 307(16): 2030-2041 (2007) - [j31]Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter:
On transitive orientations with restricted covering graphs. Inf. Process. Lett. 101(3): 119-125 (2007) - [c22]Binh-Minh Bui-Xuan, Michel Habib
, Vincent Limouzy, Fabien de Montgolfier:
Unifying Two Graph Decompositions with Modular Decomposition. ISAAC 2007: 52-64 - [i5]Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul:
Simple, linear-time modular decomposition. CoRR abs/0710.3901 (2007) - [i4]Pierre Charbit, Michel Habib
, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao:
A Note On Computing Set Overlap Classes. CoRR abs/0711.4573 (2007) - 2006
- [j30]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
On Modular Decomposition Concepts: the case for Homogeneous Relations. Electron. Notes Discret. Math. 27: 13-14 (2006) - [j29]Volker Diekert, Michel Habib:
Foreword. Theory Comput. Syst. 39(1): 1 (2006) - [c21]Binh-Minh Bui-Xuan, Michel Habib
, Vincent Limouzy, Fabien de Montgolfier:
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. WG 2006: 278-288 - [i3]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Homogeneity vs. Adjacency: generalising some graph decomposition algorithms. CoRR abs/cs/0603048 (2006) - [i2]Binh-Minh Bui-Xuan, Michel Habib
, Vincent Limouzy, Fabien de Montgolfier:
Unifying two Graph Decompositions with Modular Decomposition. CoRR abs/cs/0604065 (2006) - [i1]Binh-Minh Bui-Xuan, Michel Habib
, Vincent Limouzy, Fabien de Montgolfier:
Algorithmic Aspects of a Novel Modular Decomposition Theory. CoRR abs/cs/0611019 (2006) - 2005
- [j28]Michel Habib, Christophe Paul
:
A simple linear time algorithm for cograph recognition. Discret. Appl. Math. 145(2): 183-197 (2005) - [j27]Michel Habib
, Lhouari Nourine:
The number of Moore families on n=6. Discret. Math. 294(3): 291-296 (2005) - [c20]Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
:
Revisiting T. Uno and M. Yagiura's Algorithm . ISAAC 2005: 146-155 - 2004
- [j26]Michel Habib
, Lhouari Nourine, Olivier Raynaud, Eric Thierry:
Computational aspects of the 2-dimension of partially ordered sets. Theor. Comput. Sci. 312(2-3): 401-431 (2004) - [c19]Michel Habib
, Christophe Paul, Mathieu Raffinot:
Maximal Common Connected Sets of Interval Graphs. CPM 2004: 359-372 - [c18]Michel Habib, Fabien de Montgolfier, Christophe Paul:
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. SWAT 2004: 187-198 - [c17]Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe:
Bimodular Decomposition of Bipartite Graphs. WG 2004: 117-128 - [e2]Volker Diekert, Michel Habib:
STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings. Lecture Notes in Computer Science 2996, Springer 2004, ISBN 3-540-21236-1 [contents] - 2003
- [j25]Michel Habib, Emmanuelle Lebhar, Christophe Paul
:
A note on finding all homogeneous set sandwiches. Inf. Process. Lett. 87(3): 147-151 (2003) - [c16]Anna Bretscher, Derek G. Corneil, Michel Habib
, Christophe Paul:
A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG 2003: 119-130 - [e1]Helmut Alt, Michel Habib
:
STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings. Lecture Notes in Computer Science 2607, Springer 2003, ISBN 3-540-00623-0 [contents] - 2002
- [j24]