Main.Programme History
Hide minor edits - Show changes to output
Changed line 108 from:
''Feasibility Pump Heuristics for Column Generation Approaches''
to:
''Feasibility Pump Heuristics for Column Generation Approaches'' - [[Attach:Sadykov_FeasPumpColGen.pdf|Slides]]
Changed line 106 from:
''Compact relaxations for polynomial programming problems''
to:
''Compact relaxations for polynomial programming problems'' - [[Attach:liberti-rrlt-slides-sea12.pdf|Slides]]
Changed line 60 from:
''Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs''
to:
''Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs'' - [[Attach:campigotto-sea2012.pdf|Slides]]
Changed line 22 from:
''A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms''
to:
''A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms'' - [[Attach:sea2012-lecroq.pdf|Slides]]
Changed line 38 from:
''Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs''
to:
''Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs'' - [[Attach:SEA2012_FSantaroni.pdf|Slides]]
Changed line 96 from:
''Engineering Graph Partitioning Algorithms''
to:
''Engineering Graph Partitioning Algorithms'' - [[Attach:P_Sanders.pdf|Slides]]
Changed line 41 from:
''Relaxations of multilinear convex envelopes: dual is better than primal''
to:
''Relaxations of multilinear convex envelopes: dual is better than primal'' - [[Attach:presseacosta12.pdf|Slides]]
Changed line 63 from:
''A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs''
to:
''A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs'' - [[Attach:matchings_SEA_talk.pdf|Slides]]
Changed line 73 from:
''Engineering Efficient Paging Algorithms''
to:
''Engineering Efficient Paging Algorithms'' - [[Attach:sea12talk_negoescu.pdf|Slides]]
Changed line 104 from:
''Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach''
to:
''Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach'' - [[Attach:Schend-ControlComplexity.pptx|Slides]]
Changed line 26 from:
''Space Efficient Modifications to Structator - a Fast Index-Based Search Tool for RNA Sequence-Structure Patterns''
to:
''Space Efficient Modifications to Structator - a Fast Index-Based Search Tool for RNA Sequence-Structure Patterns'' - [[Attach:SEA2012_Vortrag.pdf|Slides]]
Changed lines 17-18 from:
''Engineering a new loop-free shortest paths routing algorithm''
to:
''Engineering a new loop-free shortest paths routing algorithm'' - [[Attach:Mattia_d_Emidio|Slides]]
_SEA2012.pdf
_SEA2012.pdf
Changed line 101 from:
''Reoptimizing the strengthened metric TSP on multiple edge weight modifications''
to:
''Reoptimizing the strengthened metric TSP on multiple edge weight modifications'' - [[Attach:Andrea_SEA2012.pptx|Slides]]
Changed line 68 from:
''Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data''
to:
''Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data'' - [[Attach:Enumeration_Perfect_phylogenies.pptx|Slides]]
Changed line 99 from:
''Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems''
to:
''Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems'' - [[Attach:Rice_GTSPP_SEA2012.pdf|Slides]]
Changed line 99 from:
''Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems'' [[Rice_GTSPP_SEA2012.pdf|Slides]]
to:
''Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems''
Changed line 80 from:
''Branch Mispredictions Don't Affect Mergesort''
to:
''Branch Mispredictions Don't Affect Mergesort'' - See the following [[http://www.diku.dk/hjemmesider/ansatte/jyrki/Myris/Kat2012-06-08P.html|web-page]]
Changed line 31 from:
''On Computing the Diameter of Real-World Directed (Weighted) Graphs''
to:
''On Computing the Diameter of Real-World Directed (Weighted) Graphs'' - [[Attach:marino.pdf|Slides]]
Changed line 78 from:
''Algorithms for subnetwork mining in heterogeneous networks''
to:
''Algorithms for subnetwork mining in heterogeneous networks'' - [[Attach:Hafedh-SEA.pdf|Slides]]
Changed line 13 from:
''Fully Dynamic Maintenance of Arc-Flags in Road Networks''
to:
''Fully Dynamic Maintenance of Arc-Flags in Road Networks'' - [[Attach:G_d_Angelo.pdf|Slides]]
Changed line 58 from:
''Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation''
to:
''Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation'' - [[Attach:SEA2012-DFM-full.ppt|Slides]]
Changed line 76 from:
''An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic''
to:
''An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic'' - [[Attach:SEA-FM-Final.pdf|Slides]]
Changed line 11 from:
''Candidate Sets for Alternative Routes in Road Networks''
to:
''Candidate Sets for Alternative Routes in Road Networks'' - [[Attach:Dennis Schieferdecker.pdf|Slides]]
Changed lines 32-33 from:
**Georgios Georgiadis and Marina Papatriantafilou - [[Attach:sea2012_georgiadis.pdf|Slides]]
''Adaptive distributed b-matching in overlays with preferences'' -
''Adaptive distributed b-matching in overlays with preferences'' -
to:
**Georgios Georgiadis and Marina Papatriantafilou\\
''Adaptive distributed b-matching in overlays with preferences'' - [[Attach:sea2012_georgiadis.pdf|Slides]]
''Adaptive distributed b-matching in overlays with preferences'' - [[Attach:sea2012_georgiadis.pdf|Slides]]
Changed lines 34-35 from:
**Annabell Berger and Matthias Müller-Hannemann - [[Attach:Berger_Muller_Hannemann.pdf|Slides]]
''How to Attack theNP-complete Dag Realization Problem in Practice''
''How to Attack the
to:
**Annabell Berger and Matthias Müller-Hannemann\\
''How to Attack the NP-complete Dag Realization Problem in Practice'' - [[Attach:Berger_Muller_Hannemann.pdf|Slides]]
''How to Attack the NP-complete Dag Realization Problem in Practice'' - [[Attach:Berger_Muller_Hannemann.pdf|Slides]]
Changed line 34 from:
**Annabell Berger and Matthias Müller-Hannemann\\
to:
**Annabell Berger and Matthias Müller-Hannemann - [[Attach:Berger_Muller_Hannemann.pdf|Slides]]
Changed line 32 from:
**Georgios Georgiadis and Marina Papatriantafilou\\ [[Attach:sea2012_georgiadis.pdf|Slides]]
to:
**Georgios Georgiadis and Marina Papatriantafilou - [[Attach:sea2012_georgiadis.pdf|Slides]]
Changed lines 32-33 from:
**Georgios Georgiadis and Marina Papatriantafilou\\
''Adaptive distributed b-matching in overlays with preferences''
to:
**Georgios Georgiadis and Marina Papatriantafilou\\ [[Attach:sea2012_georgiadis.pdf|Slides]]
''Adaptive distributed b-matching in overlays with preferences'' -
''Adaptive distributed b-matching in overlays with preferences'' -
Changed line 99 from:
''Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems''
to:
''Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems'' [[Rice_GTSPP_SEA2012.pdf|Slides]]
Changed line 84 from:
**18:30-19:00: Guided visit of the city centre. Group will be splitted into two groups of 25 persons.
to:
**18:15-19:00: Guided visit of the city centre. Group will be splitted into two groups of 25 persons.
Changed line 86 from:
**19:15-20:30: Boat tour on the river.
to:
**19:00-20:30: Boat tour on the river.
Changed line 3 from:
* 8:30-8:50 Welcome coffee
to:
* 8:30-8:50 Welcome coffee and registration
Changed line 88 from:
to:
** [[Attach:map.pdf|Social event details on the map]]
June 05, 2012, at 03:51 PM EST
by - social event (a bit) more detailed plan
Changed lines 82-84 from:
**18:15-19:00: guided visit of the city centre (meeting point in front of the 'Grand Théâtre' opera)
**19:00-20:30: boat tour on the river
**20:30-23:00: banquet dinner at restaurant [[http://fernand-bordeaux.com|'Fernand']]
**19:00-20:30: boat tour on the river
**20:30-23:00: banquet dinner at restaurant [[http
to:
**17:15 Departure from the LaBRI
**18:15 Meeting in front of the Grand Théâtre. If you wish to go by tram, take line B to 'Grand Théâtre' stop.
**18:30-19:00: Guided visit of the city centre. Group will be splitted into two groups of 25 persons.
**19:00 Meeting on 'ponton d'honneur'.
**19:15-20:30: Boat tour on the river.
**20:30-23:00: Banquet dinner at restaurant [[http://fernand-bordeaux.com|'Fernand']]. Address: 7 quai de la Douane.
**18:15 Meeting in front of the Grand Théâtre. If you wish to go by tram, take line B to 'Grand Théâtre' stop.
**18:30-19:00: Guided visit of the city centre. Group will be splitted into two groups of 25 persons.
**19:00 Meeting on 'ponton d'honneur'.
**19:15-20:30: Boat tour on the river.
**20:30-23:00: Banquet dinner at restaurant [[http://fernand-bordeaux.com|'Fernand']]. Address: 7 quai de la Douane.
Changed line 84 from:
**20:30-23:00: banquet dinner at restaurant [[http://fernand-bordeaux.com|'Le Fernand']]
to:
**20:30-23:00: banquet dinner at restaurant [[http://fernand-bordeaux.com|'Fernand']]
Changed lines 81-82 from:
* 18:00-23:00 Social event and banquet:
**18:00-19:00: guided visit of the city centre (meeting point in front of the 'Grand Théâtre' opera)
**18:
to:
* 17:15-23:00 Social event and banquet:
**18:15-19:00: guided visit of the city centre (meeting point in front of the 'Grand Théâtre' opera)
**18:15-19:00: guided visit of the city centre (meeting point in front of the 'Grand Théâtre' opera)
Changed line 84 from:
**20:30-23:00: banquet dinner at restaurant [[http://fernand-bordeaux.com|'Le Fernand']
to:
**20:30-23:00: banquet dinner at restaurant [[http://fernand-bordeaux.com|'Le Fernand']]
Changed line 84 from:
**20:30-23:00: banquet dinner at restaurant '[[http://fernand-bordeaux.com/|Le Fernand]'
to:
**20:30-23:00: banquet dinner at restaurant [[http://fernand-bordeaux.com|'Le Fernand']
Changed line 82 from:
**18:00-19:00: short guided visit of the city centre (meeting point ain front of the 'Grand Théâtre')
to:
**18:00-19:00: guided visit of the city centre (meeting point in front of the 'Grand Théâtre' opera)
Changed line 84 from:
**20:30-23:00: banquet dinner at restaurant 'Le Fernand'
to:
**20:30-23:00: banquet dinner at restaurant '[[http://fernand-bordeaux.com/|Le Fernand]'
Changed lines 81-82 from:
* 16:40-23:00 Social event and banquet:
**18:00-19:00: short guided visit of the citycentre
**18:00-19:00: short guided visit of the city
to:
* 18:00-23:00 Social event and banquet:
**18:00-19:00: short guided visit of the city centre (meeting point ain front of the 'Grand Théâtre')
**18:00-19:00: short guided visit of the city centre (meeting point ain front of the 'Grand Théâtre')
Changed lines 81-84 from:
* 16:40-23:00 Social event and banquet
to:
* 16:40-23:00 Social event and banquet:
**18:00-19:00: short guided visit of the city centre
**19:00-20:30: boat tour on the river
**20:30-23:00: banquet dinner at restaurant 'Le Fernand'
**18:00-19:00: short guided visit of the city centre
**19:00-20:30: boat tour on the river
**20:30-23:00: banquet dinner at restaurant 'Le Fernand'
Changed line 5 from:
* 9:00-10:00 Invited Talk
to:
* 9:00-10:00 Invited Talk (Chair: Ralf Klasing)
Changed line 9 from:
* 10:20-12:00 Session: Route Planning & Shortest Paths
to:
* 10:20-12:00 Session: Route Planning & Shortest Paths (Chair: Matthias Müller-Hannemann)
Changed line 19 from:
* 13:40-15:20 Session: Data Structures, Strings & Bioinformatics I
to:
* 13:40-15:20 Session: Data Structures, Strings & Bioinformatics I (Chair: Jyrki Katajainen)
Changed line 29 from:
* 15:40-17:20 Session: Graphs I
to:
* 15:40-17:20 Session: Graphs I (Chair: Thierry Lecroq)
Changed line 38 from:
* 17:30-18:45 Session: Optimization I
to:
* 17:30-18:45 Session: Optimization I (Chair: Annegret Wagler)
Changed line 52 from:
* 9:00-10:00 Invited Talk
to:
* 9:00-10:00 Invited Talk (Chair: Francois Vanderbeck)
Changed line 56 from:
* 10:20-12:00 Session: Graphs II
to:
* 10:20-12:00 Session: Graphs II (Chair: Adrian Kosowski)
Changed line 66 from:
* 13:40-14:55 Session: Data Structures, Strings & Bioinformatics II
to:
* 13:40-14:55 Session: Data Structures, Strings & Bioinformatics II (Chair: Mirosław Korzeniowski)
Changed line 74 from:
* 15:10-16:25 Session: Network Mining & Sorting
to:
* 15:10-16:25 Session: Network Mining & Sorting (Chair: David Manlove)
Changed line 87 from:
* 9:00-10:00 Invited Talk
to:
* 9:00-10:00 Invited Talk (Chair: Martin Dietzfelbinger)
Changed line 91 from:
* 10:20-11:35 Session: Graphs & Voting Protocols
to:
* 10:20-11:35 Session: Graphs & Voting Protocols (Chair: Christian Laforest)
Changed line 98 from:
* 11:45-13:00 Session: Optimization II
to:
* 11:45-13:00 Session: Optimization II (Chair: Arnaud Pêcher)
Changed lines 5-6 from:
* 9:00-10:00 Invited Talk\
->Chair: ...
->Chair: ...
to:
* 9:00-10:00 Invited Talk
Changed line 5 from:
* 9:00-10:00 Invited Talk
to:
* 9:00-10:00 Invited Talk\
Changed line 5 from:
* 9:00-10:00 Invited Talk\\
to:
* 9:00-10:00 Invited Talk
Changed lines 5-6 from:
* 9:00-10:00 Invited Talk
to:
* 9:00-10:00 Invited Talk\\
Chair: ...
Chair: ...
Added lines 88-89:
**Peter Sanders\\
''Engineering Graph Partitioning Algorithms''
''Engineering Graph Partitioning Algorithms''
Changed line 9 from:
* 10:20-12:00 Session: Route Planning & Shortest Paths I
to:
* 10:20-12:00 Session: Route Planning & Shortest Paths
Added lines 6-7:
**Friedhelm Meyer auf der Heide\\
''Continuous Local Strategies for Robotic Formation Problems''
''Continuous Local Strategies for Robotic Formation Problems''
Changed lines 9-17 from:
* 10:20-12:00 4 contributed talks
to:
* 10:20-12:00 Session: Route Planning & Shortest Paths I
** Dennis Luxen and Dennis Schieferdecker\\
''Candidate Sets for Alternative Routes in Road Networks''
** Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Frigioni and Camillo Vitale\\
''Fully Dynamic Maintenance of Arc-Flags in Road Networks''
**Dominik Kirchler, Leo Liberti and Roberto Wolfler Calvo\\
''A label correcting algorithm for the shortest path problem on a multi-modal route network''
**Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Frigioni and Vinicio Maurizio\\
''Engineering a new loop-free shortest paths routing algorithm''
** Dennis Luxen and Dennis Schieferdecker\\
''Candidate Sets for Alternative Routes in Road Networks''
** Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Frigioni and Camillo Vitale\\
''Fully Dynamic Maintenance of Arc-Flags in Road Networks''
**Dominik Kirchler, Leo Liberti and Roberto Wolfler Calvo\\
''A label correcting algorithm for the shortest path problem on a multi-modal route network''
**Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Frigioni and Vinicio Maurizio\\
''Engineering a new loop-free shortest paths routing algorithm''
Changed lines 19-27 from:
* 13:40-15:20 4 contributed talks
to:
* 13:40-15:20 Session: Data Structures, Strings & Bioinformatics I
**Simone Faro and Thierry Lecroq\\
''A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms''
**Gonzalo Navarro and Daniel Valenzuela\\
''Space-Efficient Top-k Document Retrieval''
**Benjamin Albrecht and Volker Heun\\
''Space Efficient Modifications to Structator - a Fast Index-Based Search Tool for RNA Sequence-Structure Patterns''
**Gonzalo Navarro and Eliana Providel\\
''Fast, Small, Simple Rank/Select on Bitmaps''
**Simone Faro and Thierry Lecroq\\
''A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms''
**Gonzalo Navarro and Daniel Valenzuela\\
''Space-Efficient Top-k Document Retrieval''
**Benjamin Albrecht and Volker Heun\\
''Space Efficient Modifications to Structator - a Fast Index-Based Search Tool for RNA Sequence-Structure Patterns''
**Gonzalo Navarro and Eliana Providel\\
''Fast, Small, Simple Rank/Select on Bitmaps''
Changed lines 29-30 from:
* 15:40-17:20 4 contributed talks
* 17:30-18:45 3 contributed talks
to:
* 15:40-17:20 Session: Graphs I
**Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi and Andrea Marino\\
''On Computing the Diameter of Real-World Directed (Weighted) Graphs''
**Georgios Georgiadis and Marina Papatriantafilou\\
''Adaptive distributed b-matching in overlays with preferences''
**Annabell Berger and Matthias Müller-Hannemann\\
''How to Attack the NP-complete Dag Realization Problem in Practice''
**Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi and Federico Santaroni\\
''Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs''
* 17:30-18:45 Session: Optimization I
**Alberto Costa and Leo Liberti\\
''Relaxations of multilinear convex envelopes: dual is better than primal''
**Christina Büsing and Fabio D'Andreagiovanni\\
''New results about multi-band uncertainty in Robust Optimization''
**Rodrigo F. Toso, Casimir A. Kulikowski and Ilya B. Muchnik\\
''A heuristic for non-convex variance-based clustering criteria''
**Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi and Andrea Marino\\
''On Computing the Diameter of Real-World Directed (Weighted) Graphs''
**Georgios Georgiadis and Marina Papatriantafilou\\
''Adaptive distributed b-matching in overlays with preferences''
**Annabell Berger and Matthias Müller-Hannemann\\
''How to Attack the NP-complete Dag Realization Problem in Practice''
**Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi and Federico Santaroni\\
''Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs''
* 17:30-18:45 Session: Optimization I
**Alberto Costa and Leo Liberti\\
''Relaxations of multilinear convex envelopes: dual is better than primal''
**Christina Büsing and Fabio D'Andreagiovanni\\
''New results about multi-band uncertainty in Robust Optimization''
**Rodrigo F. Toso, Casimir A. Kulikowski and Ilya B. Muchnik\\
''A heuristic for non-convex variance-based clustering criteria''
Added lines 53-54:
**Marco E. Lübbecke\\
''Automatic Decomposition and Branch-and-Price: A Status Report''
''Automatic Decomposition and Branch-and-Price: A Status Report''
Changed lines 56-64 from:
* 10:20-12:00 4 contributed talks
to:
* 10:20-12:00 Session: Graphs II
**David Manlove and Gregg O'Malley\\
''Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation''
**Eric Angel, Romain Campigotto and Christian Laforest\\
''Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs''
**Martin Dietzfelbinger, Hendrik Peilke and Michael Rink\\
''A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs''
**Ilya Safro, Peter Sanders and Christian Schulz\\
''Advanced Coarsening Schemes for Graph Partitioning''
**David Manlove and Gregg O'Malley\\
''Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation''
**Eric Angel, Romain Campigotto and Christian Laforest\\
''Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs''
**Martin Dietzfelbinger, Hendrik Peilke and Michael Rink\\
''A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs''
**Ilya Safro, Peter Sanders and Christian Schulz\\
''Advanced Coarsening Schemes for Graph Partitioning''
Changed lines 66-72 from:
* 13:40-14:55 3 contributed talks
to:
* 13:40-14:55 Session: Data Structures, Strings & Bioinformatics II
**Masashi Kiyomi, Yoshio Okamoto and Toshiki Saitoh\\
''Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data''
**Stelios Joannou and Rajeev Raman\\
''Dynamizing Succinct Tree Representations''
**Andrei Negoescu, Gabriel Moruz, Volker Weichert and Christian Neumann\\
''Engineering Efficient Paging Algorithms''
**Masashi Kiyomi, Yoshio Okamoto and Toshiki Saitoh\\
''Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data''
**Stelios Joannou and Rajeev Raman\\
''Dynamizing Succinct Tree Representations''
**Andrei Negoescu, Gabriel Moruz, Volker Weichert and Christian Neumann\\
''Engineering Efficient Paging Algorithms''
Changed lines 74-80 from:
* 15:10-16:25 3 contributed talks
to:
* 15:10-16:25 Session: Network Mining & Sorting
**Farnaz Moradi, Tomas Olovsson and Philippas Tsigas\\
''An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic''
**Guillaume Fertin, Hafedh Mohamed Babou and Irena Rusu\\
''Algorithms for subnetwork mining in heterogeneous networks''
**Amr Elmasry, Jyrki Katajainen and Max Stenmark\\
''Branch Mispredictions Don't Affect Mergesort''
**Farnaz Moradi, Tomas Olovsson and Philippas Tsigas\\
''An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic''
**Guillaume Fertin, Hafedh Mohamed Babou and Irena Rusu\\
''Algorithms for subnetwork mining in heterogeneous networks''
**Amr Elmasry, Jyrki Katajainen and Max Stenmark\\
''Branch Mispredictions Don't Affect Mergesort''
Changed lines 89-90 from:
* 10:20-11:35 3 contributed talks
* 11:45-13:00 3 contributed talks
* 11:45-13:00 3 contributed talks
to:
* 10:20-11:35 Session: Graphs & Voting Protocols
**Michael Rice and Vassilis Tsotras\\
''Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems''
**Annalisa D'Andrea and Guido Proietti\\
''Reoptimizing the strengthened metric TSP on multiple edge weight modifications''
**Jörg Rothe and Lena Schend\\
''Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach''
* 11:45-13:00 Session: Optimization II
**Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti and Frédéric Messine\\
''Compact relaxations for polynomial programming problems''
**Pierre Pesneau, Ruslan Sadykov and Francois Vanderbeck\\
''Feasibility Pump Heuristics for Column Generation Approaches''
**Jose L. Walteros and Panos M. Pardalos\\
''A Decomposition Approach for Solving Critical Clique Detection Problems''
**Michael Rice and Vassilis Tsotras\\
''Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems''
**Annalisa D'Andrea and Guido Proietti\\
''Reoptimizing the strengthened metric TSP on multiple edge weight modifications''
**Jörg Rothe and Lena Schend\\
''Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach''
* 11:45-13:00 Session: Optimization II
**Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti and Frédéric Messine\\
''Compact relaxations for polynomial programming problems''
**Pierre Pesneau, Ruslan Sadykov and Francois Vanderbeck\\
''Feasibility Pump Heuristics for Column Generation Approaches''
**Jose L. Walteros and Panos M. Pardalos\\
''A Decomposition Approach for Solving Critical Clique Detection Problems''
Changed line 5 from:
* 9:00-10:00 Invited Talk (1)
to:
* 9:00-10:00 Invited Talk
Changed line 7 from:
* 10:20-12:00 4 contributed talks (1-4)
to:
* 10:20-12:00 4 contributed talks
Changed line 9 from:
* 13:40-15:20 4 contributed talks (5-8)
to:
* 13:40-15:20 4 contributed talks
Changed lines 11-12 from:
* 15:40-17:20 4 contributed talks (9-12)
* 17:30-18:45 3 contributed talks (13-15)
* 17
to:
* 15:40-17:20 4 contributed talks
* 17:30-18:45 3 contributed talks
* 17:30-18:45 3 contributed talks
Changed line 20 from:
* 9:00-10:00 Invited Talk (2)
to:
* 9:00-10:00 Invited Talk
Changed line 22 from:
* 10:20-12:00 4 contributed talks (16-19)
to:
* 10:20-12:00 4 contributed talks
Changed line 24 from:
* 13:40-14:55 3 contributed talks (20-22)
to:
* 13:40-14:55 3 contributed talks
Changed line 26 from:
* 15:10-16:25 3 contributed talks (23-25)
to:
* 15:10-16:25 3 contributed talks
Changed line 33 from:
* 9:00-10:00 Invited Talk (3)
to:
* 9:00-10:00 Invited Talk
Changed lines 35-36 from:
* 10:20-11:35 3 contributed talks (26-28)
* 11:45-13:00 3 contributed talks (29-31)
* 11
to:
* 10:20-11:35 3 contributed talks
* 11:45-13:00 3 contributed talks
* 11:45-13:00 3 contributed talks
Changed lines 1-37 from:
to:
'''June 7 (Thursday)'''
* 8:30-8:50 Welcome coffee
* 8:50-9:00 Opening
* 9:00-10:00 Invited Talk (1)
* 10:00-10:20 Coffee break
* 10:20-12:00 4 contributed talks (1-4)
* 12:00 Lunch
* 13:40-15:20 4 contributed talks (5-8)
* 15:20-15:40 Coffee break
* 15:40-17:20 4 contributed talks (9-12)
* 17:30-18:45 3 contributed talks (13-15)
* 18:45 Conference picture
* 19:00 Welcome party (Wine and cheese)
'''June 8 (Friday)'''
* 8:40-9:00 Coffee
* 9:00-10:00 Invited Talk (2)
* 10:00-10:20 Coffee break
* 10:20-12:00 4 contributed talks (16-19)
* 12:00 Lunch
* 13:40-14:55 3 contributed talks (20-22)
* 14:55-15:10 Coffee break
* 15:10-16:25 3 contributed talks (23-25)
* 16:40-23:00 Social event and banquet
'''June 9 (Saturday)'''
* 8:40-9:00 Coffee
* 9:00-10:00 Invited Talk (3)
* 10:00-10:20 Coffee break
* 10:20-11:35 3 contributed talks (26-28)
* 11:45-13:00 3 contributed talks (29-31)
* 13:00 Lunch
* 8:30-8:50 Welcome coffee
* 8:50-9:00 Opening
* 9:00-10:00 Invited Talk (1)
* 10:00-10:20 Coffee break
* 10:20-12:00 4 contributed talks (1-4)
* 12:00 Lunch
* 13:40-15:20 4 contributed talks (5-8)
* 15:20-15:40 Coffee break
* 15:40-17:20 4 contributed talks (9-12)
* 17:30-18:45 3 contributed talks (13-15)
* 18:45 Conference picture
* 19:00 Welcome party (Wine and cheese)
'''June 8 (Friday)'''
* 8:40-9:00 Coffee
* 9:00-10:00 Invited Talk (2)
* 10:00-10:20 Coffee break
* 10:20-12:00 4 contributed talks (16-19)
* 12:00 Lunch
* 13:40-14:55 3 contributed talks (20-22)
* 14:55-15:10 Coffee break
* 15:10-16:25 3 contributed talks (23-25)
* 16:40-23:00 Social event and banquet
'''June 9 (Saturday)'''
* 8:40-9:00 Coffee
* 9:00-10:00 Invited Talk (3)
* 10:00-10:20 Coffee break
* 10:20-11:35 3 contributed talks (26-28)
* 11:45-13:00 3 contributed talks (29-31)
* 13:00 Lunch