Electronic Notes in Discrete Mathematics, Volume 25

Volume 25, August 2006

CTW 2006 - Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Lambrecht, Germany, 5-9 June 2006, Edited by U. Faigle, J.L. Hurink, F. Maffioli, R. Schrader and R. Schultz

Faisal N. Abu-Khzam, Henning Fernau:
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs. 1-6
Electronic Edition (link) BibTeX
Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n^2.75) algorithm for online topological ordering. 7-12
Electronic Edition (link) BibTeX
Stephan Dominique Andres:
Game-perfect Graphs with Clique Number 2. 13-16
Electronic Edition (link) BibTeX
Andrei Asinowski:
Suballowable sequences of permutations. 17-18
Electronic Edition (link) BibTeX
Harout K. Aydinian:
An extremal problem on graphs. 19
Electronic Edition (link) BibTeX
Janina A. Brenner, Sándor P. Fekete, Jan van der Veen:
Simultaneous Scheduling, Binding and Routing for Coarse-Grain Reconfigurable Architectures. 21-22
Electronic Edition (link) BibTeX
H. Bricard:
An adaptation of Eppstein's algorithm dealing with the k shortest - loopless and having at most p arcs - paths problem. 23-26
Electronic Edition (link) BibTeX
John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger:
Timetabling problems at the TU Eindhoven. 27-28
Electronic Edition (link) BibTeX
Tobias Brüggemann, Johann Hurink, Tjark Vredeveld, Gerhard J. Woeginger:
Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines. 29-33
Electronic Edition (link) BibTeX
Maria L. A. G. Cremers, Willem K. Klein Haneveld, Maarten H. van der Vlerk:
A Two-stage Model for a Day-ahead Paratransit Planning Problem. 35
Electronic Edition (link) BibTeX
Roman Dementiev:
Processing Huge Graphs with Stxxl. 37-38
Electronic Edition (link) BibTeX
Benjamin Doerr, Christian Klein:
Controlled Randomized Rounding. 39-40
Electronic Edition (link) BibTeX
Flavia Bonomo, Guillermo Durán, Javier Marenco:
Exploring the complexity boundary between coloring and list-coloring. 41-47
Electronic Edition (link) BibTeX
Birgit Engels, Tom Kamphans:
Randolphs Robot Game is NP-hard! 49-53
Electronic Edition (link) BibTeX
Jinfeng Feng:
Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs. 55
Electronic Edition (link) BibTeX
Henning Fernau:
Speeding up Exact Algorithms With High Probability. 57-59
Electronic Edition (link) BibTeX
Benjamin Doerr, Tobias Friedrich:
Quasirandomness in Graphs. 61-64
Electronic Edition (link) BibTeX
Uwe Gotzes:
Optimal Investments in Distributed Generation Units under Uncertainty. 65
Electronic Edition (link) BibTeX
Sven Grothklags, Ulf Lorenz:
Stochastic Airline Fleet Assignment is PSPACE-complete. 67-68
Electronic Edition (link) BibTeX
Thomas Heinze:
An Algorithm for Multistage Stochastic Integer Programs. 69
Electronic Edition (link) BibTeX
Guido Helde, Oliver Vieten:
Hamilton cycles in maximal planar graphs. 71
Electronic Edition (link) BibTeX
Mini Goyal, Shahadat Hossain:
Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms. 73-80
Electronic Edition (link) BibTeX
Gyula Y. Katona:
Hamiltonian Chains in Hypergraphs. 81-87
Electronic Edition (link) BibTeX
Sebastian Kuhn:
Risk Neutral and Risk Averse Models for Power Optimization under Uncertainty in Electricity Networks with Dispersed Generation. 89
Electronic Edition (link) BibTeX
Joachim Gehweiler, Christiane Lammersen, Christian Sohler:
A Distributed Algorithm for the Facility Location Problem. 91
Electronic Edition (link) BibTeX
Dmitrii Lozovanu, Maria Fonoberova:
Optimal Dynamic Multicommodity Flows in Networks. 93-100
Electronic Edition (link) BibTeX
Giulia Galbiati, Francesco Maffioli:
Approximating Max Cut with Limited Unbalance. 101-104
Electronic Edition (link) BibTeX
Frederike Neise:
Optimization of Dispersed Generation Systems including Risk Aversion. 105-106
Electronic Edition (link) BibTeX
Winfried Hochstättler, Robert Nickel, Britta Peis:
Two disjoint negative cycles in a signed graph. 107-111
Electronic Edition (link) BibTeX
Jacob Jan Paulus, Johann Hurink:
Adjacent-Resource Scheduling: Why spatial resources are so hard to incorporate. 113-116
Electronic Edition (link) BibTeX
Arnaud Pêcher, Annegret Wagler:
Generalized clique family inequalities for claw-free graphs. 117-121
Electronic Edition (link) BibTeX
Dmitrii Lozovanu, Stefan Pickl:
Nash Equilibria Conditions for Cyclic Games with p Players. 123-129
Electronic Edition (link) BibTeX
Raffaele Cerulli, Paolo Dell'Olmo, Monica Gentili, A. Raiconi:
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem. 131-138
Electronic Edition (link) BibTeX
Alberto Bosio, Giovanni Righini:
A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times. 139-142
Electronic Edition (link) BibTeX
Stefan Ruzika:
An Exact Algorithm for Solving Weight-Constrained Combinatorial Optimization Problems. 143-144
Electronic Edition (link) BibTeX
Sleman Saliba, Sven Oliver Krumke, Stephan Westphal:
Online-Optimization of Large-Scale Vehicle Dispatching Problems. 145-146
Electronic Edition (link) BibTeX
Ingo Schiermeyer:
Upper bounds for the chromatic number of a graph. 147-148
Electronic Edition (link) BibTeX
Ulrich Faigle, Alexander Schönhuth:
Quantum Predictor Models. 149-155
Electronic Edition (link) BibTeX
Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta:
Global offensive alliances in graphs. 157-164
Electronic Edition (link) BibTeX
Kenya Sugihara, Hiro Ito:
Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three. 165-171
Electronic Edition (link) BibTeX
A. N. Trahtman:
Notable trends concerning the synchronization of graphs and automata. 173-175
Electronic Edition (link) BibTeX
Arie M. C. A. Koster, Annegret Wagler:
On determining the imperfection ratio. 177-181
Electronic Edition (link) BibTeX
Bernhard Fuchs, Walter Kern, Xinhui Wang:
The number of tree stars is O^*(1.357^k). 183-185
Electronic Edition (link) BibTeX
Stephan Westphal, Sven Oliver Krumke, Rob van Stee:
Competitive Algorithms for Cottage Rental. 187-188
Electronic Edition (link) BibTeX