You have Guest access.
Log In
Marina Lipshteyn, Vadim E. Levit and Ross M. McConnell
Front matter
1-14
Landmarks in Algorithmic Graph Theory: A Personal Retrospective
15-26
A Higher-Order Graph Calculus for Autonomic Computing
27-35
Algorithms on Subtree Filament Graphs
36-40
A Note on the Recognition of Nested Graphs
41-53
Asynchronous Congestion Games
54-65
Combinatorial Problems for Horn Clauses
66-76
Covering a Tree by a Forest
77-86
Dominating Induced Matchings
87-99
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results
100-115
Local Search Heuristics for the Multidimensional Assignment Problem
116-126
On Distance-3 Matchings and Induced Matchings
127-133
On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph
134-143
On Path Partitions and Colourings in Digraphs
144-147
On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6
148-157
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
158-171
O(m logn) Split Decomposition of Strongly Connected Graphs
172-182
Path-Bicolorable Graphs (Extended Abstract)
183-199
Path Partitions, Cycle Covers and Integer Decomposition (Lecture Note)
200-208
Properly Coloured Cycles and Paths: Results and Open Problems
209-216
Recognition of Antimatroidal Point Sets
217-226
Tree Projections: Game Characterization and Computational Aspects
Back matter
This page requires script.
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