Abstract is missing.
- (Un)-Stable Routing in the Internet: A Survey from the Algorithmic PerspectiveLuca Cittadini, Giuseppe Di Battista, Massimo Rimondini. 1-13 [doi]
- Memory Efficient Anonymous Graph ExplorationLeszek Gasieniec, Tomasz Radzik. 14-29 [doi]
- Algorithmic Meta TheoremsMartin Grohe. 30 [doi]
- A Most General Edge Elimination PolynomialIlya Averbouch, Benny Godlin, Johann A. Makowsky. 31-42 [doi]
- Approximating the Metric TSP in Linear TimeDavide Bilò, Luca Forlizzi, Guido Proietti. 43-54 [doi]
- The Valve Location Problem in Simple Network TopologiesHans Leo Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks. 55-65 [doi]
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic GraphsPaul S. Bonsma, Florian Zickfeld. 66-77 [doi]
- On the Pseudo-achromatic Number ProblemJianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang. 78-89 [doi]
- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological ColoringsPilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca. 90-100 [doi]
- Faster Exact BandwidthMarek Cygan, Marcin Pilipczuk. 101-109 [doi]
- Additive Spanners for Circle Graphs and Polygonal GraphsFeodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang. 110-121 [doi]
- Upward Straight-Line Embeddings of Directed Graphs into Point SetsAlejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov. 122-133 [doi]
- Complexity of the Packing Coloring Problem for TreesJirí Fiala, Petr A. Golovach. 134-145 [doi]
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed EdgesJ. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz. 146-158 [doi]
- A Lower Bound on the Area Requirements of Series-Parallel GraphsFabrizio Frati. 159-170 [doi]
- On Independent Sets and Bicliques in GraphsSerge Gaspers, Dieter Kratsch, Mathieu Liedloff. 171-182 [doi]
- Evaluations of Graph PolynomialsBenny Godlin, Tomer Kotek, Johann A. Makowsky. 183-194 [doi]
- Parameterized Complexity for Domination Problems on Degenerate GraphsPetr A. Golovach, Yngve Villanger. 195-205 [doi]
- An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic DigraphGregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo. 206-217 [doi]
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval GraphsPinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos. 218-229 [doi]
- The Rank-Width of the Square GridVít Jelínek. 230-239 [doi]
- Improved Upper Bounds for Partial Vertex CoverJoachim Kneis, Alexander Langer, Peter Rossmanith. 240-251 [doi]
- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-WidthPascal Koiran, Klaus Meer. 252-263 [doi]
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential AlgorithmsAthanassios Koutsonas, Dimitrios M. Thilikos. 264-274 [doi]
- What Is between Chordal and Weakly Chordal Graphs?Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern. 275-286 [doi]
- Parameterized Graph Cleaning ProblemsDániel Marx, Ildikó Schlotter. 287-299 [doi]
- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request GraphXavier Muñoz, Ignasi Sau. 300-311 [doi]
- Fast Robber in Planar GraphsNicolas Nisse, Karol Suchan. 312-323 [doi]
- From a Circular-Arc Model to a Proper Circular-Arc ModelYahav Nussbaum. 324-335 [doi]
- Digraph Decompositions and Monotonicity in Digraph SearchingStephan Kreutzer, Sebastian Ordyniak. 336-347 [doi]
- Searching for a Visible, Lazy FugitiveDavid Richerby, Dimitrios M. Thilikos. 348-359 [doi]
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph ClassesSiamak Tazari, Matthias Müller-Hannemann. 360-371 [doi]
- Local Construction and Coloring of Spanners of Location Aware Unit Disk GraphsAndreas Wiese, Evangelos Kranakis. 372-383 [doi]