CTW04 Sessions, Program and Chairs

• Advances in Optimization I-II
  • L. Liberti, N. Maculan, S. Kucherenko, The kissing number problem: new results from global optimization
    
    
  • D. Lozovanu, S. Pickl, Special dynamic programming technique for multiobjective discrete control and for dynamic games on graph-based networks
    
    
  • A. Chierici, R. Cordone, R. Maja, The demand-dependent optimization of regular train timetables
    
    
  • W. Bein, Knowledge state algorithms and the 2-server problem
    
    
  • F. Tardella, Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
    
    
  • A. Märkert, R. Schultz, On deviation measures in stochastic integer programming
    
    
  
  
  
• Algebraic Structures
  • H. Gropp, More on orbital matrices
    
    
  • M.R. Emamy-K., The cut number of the n-cube, boolean methods and a geometric connection to threshold logic
    
    
  • F. Maffioli, N. Zagaglia Salvi, A particular class of graphic matroids
    
    
  
  
  
• Applications of Local Search
  • E. Amaldi, L. Liberti, F. Maffioli, N. Maculan, Algorithms for finding minimum fundamental cycle bases in graphs
    
    
  • D. van Dyck, V. Fack, To be or not to be Yutsis
    
    
  
  
  
• Approximability and Complexity
  • N. Ahuja, A. Baltz, B. Doerr, A. Srivastav, Coloring graphs with minimal edge load
    
    
  • U. Faigle, B. Fuchs, B. Wienand, Covering graphs by colored stable sets
    
    
  • F.V. Fomin, D.M. Thilikos, A 3-approximation for the pathwidth of Halin graphs
    
    
  • T. Doi, T. Fujito, A primal-dual method for approximating tree cover with two weights
    
    
  
  
  
• Being Hamiltonian
  • S. Zhang, B. Chen, R. Yu, Heavy cycles in k-connected weighted graphs
    
    
  • A. Asratian, A new local condition for a graph to be Hamiltonian
    
    
  
  
  
• Circulant Graphs
  • A. Uejima, H. Ito, Subdivision of the hierarchy of H-colorable graph classes by circulant graphs
    
    
  • V.E. Brimkov, Clique, chromatic, and Lovász numbers of certain circulant graphs
    
    
  
  
  
• Cliques
  • M. Cajkova, V. Fack, Clique algorithms for classifying substructures in generalized quadrangles
    
    
  • L.M. Torres, On cliques associated to 3-set packing problems
    
    
  • V.M.F. Dias, C.M.H. de Figuereido, J.L. Szwarcfiter, On the generation of bicliques of a graph
    
    
  
  
  
• Colouring Problems I-II
  • B. Zmazek, J. Zerovnik, Behzad-Vizing conjecture and Cartesian product graphs
    
    
  • T. Faik, About the b-continuity of graphs
    
    
  • C. Àlvarez, M. Serna, The proper interval colored graph problem for caterpillar trees
    
    
  • A. Vietri, The complexity of arc-colorings for directed hypergraphs
    
    
  
  
  
• Data Structures and Retrieval
  • B. Doerr, N. Hebbinghaus, S. Werth, An improved discrepancy approach to declustering
    
    
  • K. Fukuda, S. Picozzi, Lexico-smallest representations, duality and matching polyhedra
    
    
  • N. Betzler, R. Niedermeier, J. Uhlmann, Tree decompositions of graphs: saving memory in dynamic programming
    
    
  
  
  
• Exact Algorithms I-II
  • G. Nicosia, A. Pacifici, Exact algorithms for a discrete metric labelling problem
    
    
  • T. Brueggemann, W. Kern, An improved local search algorithm for 3-SAT
    
    
  • M. Joswig, M.E. Pfetsch, Computing optimal discrete morse functions
    
    
  • R. Aringhieri, R. Cordone, The multicommodity multilevel bottleneck assignment problem (presented by G. Righini)
    
    
  
  
  
• Flows and Networks I-II
  • D. Gijswijt, On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices
    
    
  • A. Altn, E. Amaldi, P. Belotti, F. Maffioli, M. Ç. Pnar, Virtual private network design under traffic uncertainty
    
    
  • M.-C. Costa, A. Billionnet, Multiway cut and integer flow problems in trees
    
    
  • S.G. Kolliopoulos, Minimum-cost single-source 2-splittable flow
    
    
  
  
  
• Graph Theory I-II
  • J.-L. Fouquet, J.-M. Vanherpe, On (P₅,[`P]₅)-sparse graphs and other families
    
    
  • V. Giakoumakis, S. Olariu, The set of prime extensions of a graph: the finite and the infinite case
    
    
  • E. Prisner, k-Pseudosnakes in n-dimensional hypercubes
    
    
  • M. Aïder, Extended distance-hereditary graphs
    
    
  
  
  
• Numbers and Graphs
  • N. Hebbinghaus, Discrepancy of sums of arithmetic progressions
    
    
  • A.N.M. Salman, H.J. Broersma, The Ramsey numbers of paths versus kipases
    
    
  
  
  
• Polynomial Cases of Problems in NP
  • F. Carrabs, R. Cerulli, M. Gentili, G. Parlato, Minimum feedback vertex set on diamonds
    
    
  • P. Detti, C. Meloni, M. Pranzo, Minimum dominating trail set for two-terminal series parallel graphs
    
    
  • W.Y.C. Chen, X. Li, C. Wang, X. Zhang, Linear time algorithms to the minimum all-ones problem for unicyclic and bicyclic graphs
    
    
  
  
  
• Polynomial Problems
  • M. Wattenhofer, R. Wattenhofer, Fast and Simple Algorithms for Weighted Perfect Matching
    
    
  • S. Nikolopoulos, L. Palios, On the strongly connected and biconnected components of the complement of graphs
    
    
  
  
  
• TSP and Routing I-II
  • V. Deineko, New exponential neighbourhood for polynomially solvable TSPs
    
    
  • G. Righini, M. Salani, Dynamic programming algorithms for the elementary shortest path problem with resource constraints
    
    
  • D. Räbiger, Semi-preemptive routing on a line
    
    
  • R. Aringhieri, M. Bruglieri, F. Malucelli, M. Nonato, An asymmetric vehicle routing problem arising in the collection and disposal of special waste
    
    
  • D. Cantone, S. Faro, Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
    
    
  • P. Belotti, F. Malucelli, Network design with grooming constraints
    
    
  
  
  

• Lunch will take place at 13:00.
  
  
• Dinner will take place at 19:30.
  
  
• On Tuesday, 1st June 2004, at 21:00, there will be a piano concert in the Conference Hall. The pianist Massimo Bianchi will play the following program:
  • F. Chopin, Andante spianato e Polacca brillante, op. 22
    
    
  • F. Liszt, Scherzo e Marcia
    
    
  • Beethoven/Liszt, Piano transcription of Symphony n. 7, op. 92:
    Poco sostenuto-Vivace - Allegretto - Presto - Allegro con brio
    
    
  
  
  
• Lunch will also be served at 13:00 on Wednesday 2nd June after the Closing session.

Session Chairs

31/5 11:15 Conference Hall, plenary Queyranne/ FAIGLE
31/5 14:30-16:30 Conference Hall, Approximability and Complexity/ MAFFIOLI
31/5 17-18 Conference Hall, Advances in Optimization II/ SCHULTZ
31/5 14:30-16:30 Sala Marcolini, Advances in Optimization I/ PICKL
31/5 17-18 Sala Marcolini, Being Hamiltonian/ DEINEKO
31/5 14:30-15:30 Library, Circulant Graphs/ PRISNER
31/5 15:30-18 Library, Colouring Problems I & II/ ZEROVNIK

1/6 9 Conference Hall, plenary Stougie/ MALUCELLI
1/6 10-12:30 Conference Hall, Graph Theory I & II/ FUCHS
1/6 10-12:30 Sala Marcolini, Flows and Networks I & II/ PINAR
1/6 10-12:30 Library, Exact Algorithms I & II/ RIGHINI
1/6 14:30-16 Conference Hall, TSP and Routing I/ HAMACHER
1/6 16:30-17:30 Conference Hall, Polynomial Problems/ AMALDI
1/6 14:30-16 Sala Marcolini, Cliques/ TARDELLA
1/6 16:30-17:30 Sala Marcolini, Numbers and Graphs/ STOUGIE
1/6 14:30-16 Library, Polynomial Cases of Problems in NP/ QUEYRANNE
1/6 16:30-17:30 Library, Applications of Local Search/ LIBERTI

2/6 9 Conference Hall, plenary Hamacher/ MAFFIOLI
2/6 10:30-12 Conference Hall, TSP and Routing II/ CORDONE
2/6 10:30-12 Sala Marcolini, Algebraic Structures/ SCHRADER
2/6 10:30-12 Library, Data structures and retrieval/ WERTH