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