Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Spanning trees with low crossing number

Jiří Matoušek

RAIRO-Theor. Inf. Appl., 25 2 (1991) 103-123

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1991250201031

This article has been cited by the following article(s):

Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension

Guillaume Ducoffe, Michel Habib and Laurent Viennot
SIAM Journal on Computing 51 (5) 1506 (2022)
https://doi.org/10.1137/20M136551X

Optimal Partition Trees

Timothy M. Chan
Discrete & Computational Geometry 47 (4) 661 (2012)
https://doi.org/10.1007/s00454-012-9410-z

Timothy M. Chan
1 (2010)
https://doi.org/10.1145/1810959.1810961

Rom Pinchasi
141 (2009)
https://doi.org/10.1145/1542362.1542393

Tight Bounds for Connecting Sites Across Barriers

David Krumme, Eynat Rafalin, Diane L. Souvaine and Csaba D. Tóth
Discrete & Computational Geometry 40 (3) 377 (2008)
https://doi.org/10.1007/s00454-007-9025-y

Erin W. Chambers, Jeff Erickson and Pratik Worah
251 (2008)
https://doi.org/10.1145/1377676.1377721

David W. Krumme, Eynat Rafalin, Diane L. Souvaine and Csaba D. Tóth
439 (2006)
https://doi.org/10.1145/1137856.1137920

Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink and Hisao Tamaki
41 (1999)
https://doi.org/10.1145/304893.304907

Algorithms — ESA '96

Julien Basch, Leonidas J. Guibas and G. D. Ramkumar
Lecture Notes in Computer Science, Algorithms — ESA '96 1136 302 (1996)
https://doi.org/10.1007/3-540-61680-2_64

Testing homotopic routability under polygonal wiring rules

F. M. Maley
Algorithmica 15 (1) 1 (1996)
https://doi.org/10.1007/BF01942604

Variations on ray shooting

Reuven Bar-Yehuda and Sergio Fogel
Algorithmica 11 (2) 133 (1994)
https://doi.org/10.1007/BF01182772

Applications of a new space-partitioning technique

Pankaj K. Agarwal and Micha Sharir
Discrete & Computational Geometry 9 (1) 11 (1993)
https://doi.org/10.1007/BF02189304

Range searching with efficient hierarchical cuttings

Jiří Matoušek
Discrete & Computational Geometry 10 (2) 157 (1993)
https://doi.org/10.1007/BF02573972

Data structures and efficient algorithms

Emo Welzl
Lecture Notes in Computer Science, Data structures and efficient algorithms 594 233 (1992)
https://doi.org/10.1007/3-540-55488-2_30

Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number

Pankaj K. Agarwal
SIAM Journal on Computing 21 (3) 540 (1992)
https://doi.org/10.1137/0221035