You have Guest access.
Log In
Oren Weimann and Raphael Yuster
Journal Article
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs
Sergio Cabello and Bojan Mohar
Discrete & Computational Geometry, 2007, Volume 37, Number 2, Pages 213-235
Book Chapter
Approximating List-Coloring on a Fixed Surface
Ken-ichi Kawarabayashi
Lecture Notes in Computer Science, 2008, Volume 5125, Automata, Languages and Programming, Pages 333-344
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees (Extended Abstract)
Yuval Emek
Lecture Notes in Computer Science, 2009, Volume 5757, Algorithms - ESA 2009, Pages 203-214
Perturbative Time and Frequency Allocations for RFID Reader Networks
Vinay Deolalikar, Malena Mesarina, John Recker and Salil Pradhan
Lecture Notes in Computer Science, 2006, Volume 4097, Emerging Directions in Embedded and Ubiquitous Computing, Pages 392-402
New Approximation Algorithms for Minimum Cycle Bases of Graphs
Telikepalli Kavitha, Kurt Mehlhorn and Dimitrios Michail
Algorithmica, 2011, Volume 59, Number 4, Pages 471-488
Computing the Girth of a Planar Graph
Hristo N. Djidjev
Lecture Notes in Computer Science, 2000, Volume 1853, Automata, Languages and Programming, Pages 821-831
Algorithms for Graphs Embeddable with Few Crossings per Edge
Alexander Grigoriev and Hans L. Bodlaender
Algorithmica, 2007, Volume 49, Number 1, Pages 1-11
A Separator Theorem for String Graphs and Its Applications
Jacob Fox and János Pach
Lecture Notes in Computer Science, 2009, Volume 5431, WALCOM: Algorithms and Computation, Pages 1-14
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
Feodor F. Dragan, Fedor V. Fomin and Petr A. Golovach
Lecture Notes in Computer Science, 2008, Volume 5162, Mathematical Foundations of Computer Science 2008, Pages 290-298
Goal-minimally k -elongated graphs
Štefan Gyürki
Mathematica Slovaca, 2009, Volume 59, Number 2, Pages 193-200
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info