Journal: Discrete Applied Mathematics

Volume 108, Issue 3

211 -- 226Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams. Maximum-entropy remote sampling
227 -- 238Yijie Han, Weifa Liang, Xiaojun Shen. Very fast parallel algorithms for approximate edge coloring
239 -- 257Claire Hanen, Alix Munier. An approximation algorithm for scheduling dependent tasks on m processors with small communication delays
259 -- 267Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia. Ray shooting from convex ranges
269 -- 285Jon Lee, Dan Wilson. Polyhedral methods for piecewise-linear functions I: the lambda method
287 -- 300Victor Mitrana, Ralf Stiebe. Extended finite automata over groups
301 -- 308Andreas Brandstädt, Vadim V. Lozin. A note on alpha-redundant vertices in graphs
309 -- 316Jon T. Butler, Gerhard W. Dueck, Svetlana N. Yanushkevich, Vlad P. Shmerko. On the number of generators for transeunt triangles
317 -- 323Walter Kern, Daniël Paulusma. The new FIFA rules are hard: complexity aspects of sports competitions
325 -- 328Gerhard J. Woeginger. A note on the depth function of combinatorial optimization problems
329 -- 333Guochuan Zhang. An on-line bin-batching problem

Volume 108, Issue 1-2

1 -- 2Juraj Hromkovic, Ondrej Sýkora. Preface
3 -- 21Serafino Cicerone, Gabriele Di Stefano. Graphs with bounded induced distance
23 -- 52Bruno Courcelle, Johann A. Makowsky, Udi Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
53 -- 64Peter Damaschke. Minus domination in small-degree graphs
65 -- 83Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto. SPLITTING NUMBER is NP-complete
85 -- 103Sándor P. Fekete, Jana Kremer. Tree spanners in planar graphs
105 -- 127Dagmar Handke. Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees
129 -- 142Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth. Upgrading bottleneck constrained forests
143 -- 173Markus Röttger, Ulf-Peter Schroeder. Efficient embeddings of grids into grids
175 -- 191Farhad Shahrokhi, László A. Székely. Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem
193 -- 210Maurizio Talamo, Paola Vocca. Representing graphs implicitly using almost optimal space