CTW 2004:
Menaggio,
Italy
Leo Liberti, Francesco Maffioli (Eds.):
CTW04 Workshop on Graphs and Combinatorial Optimization, Scientific Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June 2004.
2004 
Invited Talks
- Horst W. Hamacher:
Decomposition of Consecutive-1 Matrices and Applications.
12
- Maurice Queyranne:
Submodular Function Minimization in Zetan and Searching in Monge arrays.
13
- Leen Stougie:
Polynomial Solvability of Mader's Edge-disjoint Paths Problem.
14
Contributed Papers
- Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav:
Coloring Graphs with Minimal Edge Load.
16-20
- Méziane Aïder:
Extended Distance-Hereditary Graphs.
21-23
- Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar:
Virtual Private Network Design Under Traffic Uncertainty.
24-27
- C. Àlvarez, N. Serna:
The Proper Interval Colored Graph Problem for Caterpillar Trees.
28-32
- Edoardo Amaldi, Leo Liberti, Francesco Maffioli:
Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs.
33-36
- Roberto Aringhieri, Roberto Cordone:
The Multicommodity Multilevel Bottleneck Assignment Problem.
37-40
- Roberto Aringhieri, Maurizio Bruglieri, Federico Malucelli, Maddalena Nonato:
An Asymmetric Vehicle Routing Problem arising in the Collection and Disposal of Special Waste.
41-46
- Armen S. Asratian:
A New Local Condition for a Graph to be Hamiltonian.
47-49
- Wolfgang W. Bein:
Knowledge State Algorithms and the 2-Server Problem.
50
- Pietro Belotti, Federico Malucelli:
Network Design with Grooming Constraints.
51-55
- Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming.
56-60
- Valentin E. Brimkov:
Clique, Chromatic, and Lovász Numbers of Certain Circulant Graphs.
61-65
- Tobias Brüggemann, Walter Kern:
An Improved Local Search Algorithm for 3-SAT.
66-70
- Miroslava Cajkova, Veerle Fack:
Clique Algorithms for Classifying Substructures in Generalized Quadrangles.
71-74
- Domenico Cantone, Simone Faro:
Two-Levels-Greedy: A Generalized of Dijkstra's Shortest Path Algorithm.
75-80
- Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
Minimum Weighted Feedback Vertex Set on Diamonds.
81-85
- William Y. C. Chen, Xueliang Li, Chao Wang, Xiaoyan Zhang:
Linear Time Algorithms to the Minimum All-Ones Problem for UniCyclic and Bicyclic Graphs.
86-90
- Alessandro Chierici, Roberto Cordone, Roberto Maja:
The Demand-dependent Optimization of Regular Train Timetables.
91-95
- Marie-Christine Costa, Alain Billionnet:
Multiway Cut and Integer Flow Problems in Trees.
96-99
- V. Deineko:
New Exponential Neighbourhood for Polynomially Solvable TSPs.
100-103
- Paolo Detti, Carlo Meloni, Marco Pranzo:
Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs.
104-108
- Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter:
On the Generation of Bicliques of a Graph.
109-113
- Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
An Improved Discrepancy Approach to Declustering.
114-118
- Takashi Doi, Toshihiro Fujito:
A Primal-Dual Method for Approximating Tree Cover with Two Weights.
119-123
- M. Reza Emamy-Khansary:
The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic.
124-126
- Ulrich Faigle, Bernhard Fuchs, Britta Wienand:
Covering Graphs by Colored Stable Sets.
127-131
- Taoufik Faik:
About the b-Continuity of Graphs.
132-136
- Fedor V. Fomin, Dimitrios M. Thilikos:
A 3-Approximation for the Pathwidth of Halin Graphs.
137-141
- Jean-Luc Fouquet, Jean-Marie Vanherpe:
On (P5, P5)-Sparse Graphs and other Families.
142-146
- Komei Fukuda, Stefano Picozzi:
Lexico-smallest Representations, Duality and Matching Polyhedra.
147-151
- Vassilis Giakoumakis, Stephan Olariu:
The Set of Prime Extensions of a Graph: the Finite and the Infinite Case.
152-156
- Dion Gijswijt:
On a Packet Scheduling Problem for Smart Antennas and Polyhedra Defined Circular-ones Matrices.
157-159
- Harald Gropp:
More on Orbital Matrices.
160-164
- Nils Hebbinghaus:
Discrepancy of Sums of Arithmetic Progressions.
165-169
- Michael Joswig, Marc E. Pfetsch:
Computing Optimal Discrete Morse Functions.
170-174
- Stavros G. Kolliopoulos:
Minimum-Cost Single-Source 2-Splittable Flow.
175-179
- Leo Liberti, Nelson Maculan, Sergei Kucherenko:
The Kissing Number Problem: A New Result from Global Optimization.
180-183
- Dmitrii Lozovanu, Stefan Wolfgang Pickl:
A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks.
184-188
- Andreas Märkert, Rüdiger Schultz:
On Deviation Measures in Stochastic Integer Programming.
189-191
- Francesco Maffioli, Norma Zagaglia Salvi:
A Particular Class of Graphic Matroids.
192-195
- Gaia Nicosia, Andrea Pacifici:
Exact Algorithms for a Discrete Metric Labeling Problem.
196-200
- Stavros D. Nikolopoulos, Leonidas Palios:
On the Strongly Connected and Biconnected Components of the Complement of Graphs.
201-206
- Erich Prisner:
k-Pseudosnakes in n-dimensional Hypercubes.
207-209
- Dirk Räbiger:
Semi-preemptive Routing on a Line.
210-214
- Giovanni Righini, Matteo Salani:
Dynamic Programming Algorithms for the Elementary Shortest Path Problem with Resource Constraints.
215-217
- A. N. M. Salman, Hajo Broersma:
The Ramsey Numbers of Paths Versus Kipases.
218-222
- Fabio Tardella:
Connections between Continuous and Combinatorial Optimization Problems through an Extension of the Fundamental Theorem of Linear Programming.
223-227
- Luis Miguel Torres:
On Cliques associated to 3-set Packing Problems.
228-231
- Akihiro Uejima, Hiro Ito:
Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant Graphs.
232-236
- Dries Van Dyck, Veerle Fack:
To be or not to be Yutsis.
237-241
- Andrea Vietri:
The Complexity of Arc-coloring for Directed Hypergraphs.
242-245
- Mirjam Wattenhofer, Roger Wattenhofer:
Fast and Simple Algorithms for Weighted Perfect Matching.
246-252
- Shenggui Zhang, Bing Chen, Rongzu Yu:
Heavy Cycles in k-connected Weighted Graphs.
253-256
- Blaz Zmazek, Janez Zerovnik:
Behzad-Vizing Conjecture and Cartesian Product Graphs.
257-260
Last update Thu May 24 04:15:08 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
