Main.Papers History

Hide minor edits - Show changes to output

March 13, 2012, at 11:27 AM EST by 147.210.128.134 -
Changed line 15 from:
# David Manlove and Gregg O'Malley.[[<<]]''Paired Kidney Exchange in the UK: Algorithms and Experimentation''.
to:
# David Manlove and Gregg O'Malley.[[<<]]''Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation''.
March 10, 2012, at 12:29 AM EST by 82.125.118.204 -
Changed line 1 from:
!!'''List of Accepted Papers (in submission order)'''
to:
!! [-List of Accepted Papers (in submission order)-]
March 10, 2012, at 12:03 AM EST by 82.125.118.204 -
Changed line 1 from:
!!!'''List of Accepted Papers (in submission order)'''
to:
!!'''List of Accepted Papers (in submission order)'''
March 10, 2012, at 12:02 AM EST by 82.125.118.204 -
Changed line 1 from:
!!'''List of Accepted Papers (in submission order)'''
to:
!!!'''List of Accepted Papers (in submission order)'''
March 10, 2012, at 12:02 AM EST by 82.125.118.204 -
Changed line 1 from:
[+'''List of Accepted Papers (in submission order)'''+]
to:
!!'''List of Accepted Papers (in submission order)'''
March 09, 2012, at 11:50 PM EST by 82.125.118.204 -
Changed line 1 from:
'''List of Accepted Papers (in submission order):'''
to:
[+'''List of Accepted Papers (in submission order)'''+]
March 09, 2012, at 08:05 PM EST by 82.125.118.204 -
Changed line 1 from:
'''List of Accepted Papers (in submission order)'''
to:
'''List of Accepted Papers (in submission order):'''
March 09, 2012, at 07:29 PM EST by 82.125.118.204 -
Changed line 1 from:
'''List of Accepted Papers (in submission order):'''
to:
'''List of Accepted Papers (in submission order)'''
March 09, 2012, at 07:28 PM EST by 82.125.118.204 -
Changed line 1 from:
'''LIST OF ACCEPTED PAPERSist of Accepted Papers (in submission order):'''
to:
'''List of Accepted Papers (in submission order):'''
March 09, 2012, at 07:28 PM EST by 82.125.118.204 -
Changed line 1 from:
'''List of Accepted Papers (in submission order):'''
to:
'''LIST OF ACCEPTED PAPERSist of Accepted Papers (in submission order):'''
March 09, 2012, at 07:27 PM EST by 82.125.118.204 -
Changed line 1 from:
'''List of Accepted Papers (in submission order)'''
to:
'''List of Accepted Papers (in submission order):'''
March 09, 2012, at 07:26 PM EST by 82.125.118.204 -
Changed line 1 from:
'''List of accepted papers (in submission order)'''
to:
'''List of Accepted Papers (in submission order)'''
March 09, 2012, at 07:26 PM EST by 82.125.118.204 -
Changed line 1 from:
'''List of accepted papers (in submission order):'''
to:
'''List of accepted papers (in submission order)'''
March 09, 2012, at 07:25 PM EST by 82.125.118.204 -
Changed line 1 from:
List of accepted papers (in submission order):
to:
'''List of accepted papers (in submission order):'''
March 09, 2012, at 07:24 PM EST by 82.125.118.204 -
Changed line 1 from:
The following papers (in submission order) have been accepted for presentation:
to:
List of accepted papers (in submission order):
March 09, 2012, at 07:21 PM EST by 82.125.118.204 -
Added lines 1-2:
The following papers (in submission order) have been accepted for presentation:
Changed lines 2-31 from:
# 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
# Georgios Georgiadis and Marina Papatriantafilou.[[<<]]Adaptive distributed b-matching in overlays with preferences
# Michael Rice and Vassilis Tsotras.[[<<]]Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems
# 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
# Jörg Rothe and Lena Schend.[[<<]]Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach
# Jose L. Walteros and Panos M. Pardalos.[[<<]]A Decomposition Approach for Solving Critical Clique Detection Problems
# Masashi Kiyomi, Yoshio Okamoto and Toshiki Saitoh.[[<<]]Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
# Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti and Frédéric Messine.[[<<]]Compact relaxations for polynomial programming problems
# Annabell Berger and Matthias Müller-Hannemann.[[<<]]How to Attack the NP-complete Dag Realization Problem in Practice
# David Manlove and Gregg O'Malley.[[<<]]Paired Kidney Exchange in the UK: Algorithms and Experimentation
# Stelios Joannou and Rajeev Raman.[[<<]]Dynamizing Succinct Tree Representations
# 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
# Alberto Costa and Leo Liberti.[[<<]]Relaxations of multilinear convex envelopes: dual is better than primal
# Ilya Safro, Peter Sanders and Christian Schulz.[[<<]]Advanced Coarsening Schemes for Graph Partitioning
# Amr Elmasry, Jyrki Katajainen and Max Stenmark.[[<<]]Branch Mispredictions Don't Affect Mergesort
# Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Frigioni and Camillo Vitale.[[<<]]Fully Dynamic Maintenance of Arc-Flags in Road Networks
# Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi and Federico Santaroni.[[<<]]Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs
# Farnaz Moradi, Tomas Olovsson and Philippas Tsigas.[[<<]]An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic
# Dominik Kirchler, Leo Liberti and Roberto Wol&#64258;er 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
# Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi and Andrea Marino.[[<<]]On Computing the Diameter of Real-World Directed (Weighted) Graphs
# Guillaume Fertin, Hafedh Mohamed Babou and Irena Rusu.[[<<]]Algorithms for subnetwork mining in heterogeneous networks
# Andrei Negoescu, Gabriel Moruz, Volker Weichert and Christian Neumann.[[<<]]Engineering Efficient Paging Algorithms
# 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
# Pierre Pesneau, Ruslan Sadykov and Francois Vanderbeck.[[<<]]Feasibility Pump Heuristics for Column Generation Approaches
# Annalisa D'Andrea and Guido Proietti.[[<<]]Reoptimizing the strengthened metric TSP on multiple edge weight modifications
to:
# 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''.
# Georgios Georgiadis and Marina Papatriantafilou.[[<<]]''Adaptive distributed b-matching in overlays with preferences''.
# Michael Rice and Vassilis Tsotras.[[<<]]''Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems''.
# 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''.
# Jörg Rothe and Lena Schend.[[<<]]''Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach''.
# Jose L. Walteros and Panos M. Pardalos.[[<<]]''A Decomposition Approach for Solving Critical Clique Detection Problems''.
# Masashi Kiyomi, Yoshio Okamoto and Toshiki Saitoh.[[<<]]''Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data''.
# Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti and Frédéric Messine.[[<<]]''Compact relaxations for polynomial programming problems''.
# Annabell Berger and Matthias Müller-Hannemann.[[<<]]''How to Attack the NP-complete Dag Realization Problem in Practice''.
# David Manlove and Gregg O'Malley.[[<<]]''Paired Kidney Exchange in the UK: Algorithms and Experimentation''.
# Stelios Joannou and Rajeev Raman.[[<<]]''Dynamizing Succinct Tree Representations''.
# 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''.
# Alberto Costa and Leo Liberti.[[<<]]''Relaxations of multilinear convex envelopes: dual is better than primal''.
# Ilya Safro, Peter Sanders and Christian Schulz.[[<<]]''Advanced Coarsening Schemes for Graph Partitioning''.
# Amr Elmasry, Jyrki Katajainen and Max Stenmark.[[<<]]''Branch Mispredictions Don't Affect Mergesort''.
# Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Frigioni and Camillo
Vitale.[[<<]]''Fully Dynamic Maintenance of Arc-Flags in Road Networks''.
# Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi and Federico Santaroni.[[<<]]''Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs''.
# Farnaz Moradi, Tomas Olovsson and Philippas Tsigas.[[<<]]''An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic''.
# Dominik Kirchler, Leo Liberti and Roberto Wol&#64258;er 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''.
# Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi and Andrea Marino.[[<<]]''On Computing the Diameter of Real-World Directed (Weighted) Graphs''.
# Guillaume Fertin, Hafedh Mohamed Babou and Irena Rusu.[[<<]]''Algorithms for subnetwork mining in heterogeneous networks''.
# Andrei Negoescu, Gabriel Moruz, Volker Weichert and Christian Neumann.[[<<]]''Engineering Efficient Paging Algorithms''.
# 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''.
# Pierre Pesneau, Ruslan Sadykov and Francois Vanderbeck.[[<<]]''Feasibility Pump Heuristics for Column Generation Approaches''.
# Annalisa D'Andrea and Guido
Proietti.[[<<]]''Reoptimizing the strengthened metric TSP on multiple edge weight modifications''.
Changed line 1 from:
# Dennis Luxen and Dennis Schieferdecker.[[<<]]Candidate Sets for Alternative Routes in Road Networks.
to:
# Dennis Luxen and Dennis Schieferdecker.[[<<]]''Candidate Sets for Alternative Routes in Road Networks''.
Changed lines 5-31 from:
# Michael Rice and Vassilis Tsotras. Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems
# 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
# Jörg Rothe and Lena Schend. Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach
# Jose L. Walteros and Panos M. Pardalos. A Decomposition Approach for Solving Critical Clique Detection Problems
# Masashi Kiyomi, Yoshio Okamoto and Toshiki Saitoh. Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
# Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti and Frédéric Messine. Compact relaxations for polynomial programming problems
# Annabell Berger and Matthias Müller-Hannemann. How to Attack the NP-complete Dag Realization Problem in Practice
# David Manlove and Gregg O'Malley. Paired Kidney Exchange in the UK: Algorithms and Experimentation
# Stelios Joannou and Rajeev Raman. Dynamizing Succinct Tree Representations
# 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
# Alberto Costa and Leo Liberti. Relaxations of multilinear convex envelopes: dual is better than primal
# Ilya Safro, Peter Sanders and Christian Schulz. Advanced Coarsening Schemes for Graph Partitioning
# Amr Elmasry, Jyrki Katajainen and Max Stenmark. Branch Mispredictions Don't Affect Mergesort
# Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Frigioni and Camillo Vitale. Fully Dynamic Maintenance of Arc-Flags in Road Networks
# Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi and Federico Santaroni. Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs
# Farnaz Moradi, Tomas Olovsson and Philippas Tsigas. An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic
# Dominik Kirchler, Leo Liberti and Roberto Wol&#64258;er 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
# Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi and Andrea Marino. On Computing the Diameter of Real-World Directed (Weighted) Graphs
# Guillaume Fertin, Hafedh Mohamed Babou and Irena Rusu. Algorithms for subnetwork mining in heterogeneous networks
# Andrei Negoescu, Gabriel Moruz, Volker Weichert and Christian Neumann. Engineering Efficient Paging Algorithms
# 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
# Pierre Pesneau, Ruslan Sadykov and Francois Vanderbeck. Feasibility Pump Heuristics for Column Generation Approaches
# Annalisa D'Andrea and Guido Proietti. Reoptimizing the strengthened metric TSP on multiple edge weight modifications
to:
# Michael Rice and Vassilis Tsotras.[[<<]]Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems
# 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
# Jörg Rothe and Lena Schend.[[<<]]Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach
# Jose L. Walteros and Panos M. Pardalos.[[<<]]A Decomposition Approach for Solving Critical Clique Detection Problems
# Masashi Kiyomi, Yoshio Okamoto and Toshiki Saitoh.[[<<]]Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
# Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti and Frédéric Messine.[[<<]]Compact relaxations for polynomial programming problems
# Annabell Berger and Matthias Müller-Hannemann.[[<<]]How to Attack the NP-complete Dag Realization Problem in Practice
# David Manlove and Gregg O'Malley.[[<<]]Paired Kidney Exchange in the UK: Algorithms and Experimentation
# Stelios Joannou and Rajeev Raman.[[<<]]Dynamizing Succinct Tree Representations
# 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
# Alberto Costa and Leo Liberti.[[<<]]Relaxations of multilinear convex envelopes: dual is better than primal
# Ilya Safro, Peter Sanders and Christian Schulz.[[<<]]Advanced Coarsening Schemes for Graph Partitioning
# Amr Elmasry, Jyrki Katajainen and Max Stenmark.[[<<]]Branch Mispredictions Don't Affect Mergesort
# Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Frigioni and Camillo Vitale.[[<<]]Fully Dynamic Maintenance of Arc-Flags in Road Networks
# Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi and Federico Santaroni.[[<<]]Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs
# Farnaz Moradi, Tomas Olovsson and Philippas Tsigas.[[<<]]An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic
# Dominik Kirchler, Leo Liberti and Roberto Wol&#64258;er 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
# Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi and Andrea Marino.[[<<]]On Computing the Diameter of Real-World Directed (Weighted) Graphs
# Guillaume Fertin, Hafedh Mohamed Babou and Irena Rusu.[[<<]]Algorithms for subnetwork mining in heterogeneous networks
# Andrei Negoescu, Gabriel Moruz, Volker Weichert and Christian Neumann.[[<<]]Engineering Efficient Paging Algorithms
# 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
# Pierre Pesneau, Ruslan Sadykov and Francois Vanderbeck.[[<<]]Feasibility Pump Heuristics for Column Generation Approaches
# Annalisa D'Andrea and Guido Proietti.[[<<]]Reoptimizing the strengthened metric TSP on multiple edge weight modifications
Changed lines 1-3 from:
# Candidate Sets for Alternative Routes in Road Networks.[[<<]]Dennis Luxen and Dennis Schieferdecker.

to:
# Dennis Luxen and Dennis Schieferdecker.[[<<]]Candidate Sets for Alternative Routes in Road Networks.
Changed lines 4-6 from:
# 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
# Georgios Georgiadis and Marina Papatriantafilou. Adaptive distributed b-matching in overlays with preferences
to:
# 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
# Georgios Georgiadis and Marina Papatriantafilou.[[<<]]Adaptive distributed b-matching in overlays with preferences
Changed lines 1-2 from:
# Candidate Sets for Alternative Routes in Road Networks.
   Dennis Luxen and Dennis Schieferdecker.
to:
# Candidate Sets for Alternative Routes in Road Networks.[[<<]]Dennis Luxen and Dennis Schieferdecker.
Changed lines 1-2 from:
# Dennis Luxen and Dennis Schieferdecker. Candidate Sets for Alternative Routes in Road Networks
to:
# Candidate Sets for Alternative Routes in Road Networks.
  Dennis Luxen and Dennis Schieferdecker.
Added line 2:
Added line 2:
Added lines 1-31:
# Dennis Luxen and Dennis Schieferdecker. Candidate Sets for Alternative Routes in Road Networks
# 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
# Georgios Georgiadis and Marina Papatriantafilou. Adaptive distributed b-matching in overlays with preferences
# Michael Rice and Vassilis Tsotras. Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems
# 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
# Jörg Rothe and Lena Schend. Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach
# Jose L. Walteros and Panos M. Pardalos. A Decomposition Approach for Solving Critical Clique Detection Problems
# Masashi Kiyomi, Yoshio Okamoto and Toshiki Saitoh. Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
# Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti and Frédéric Messine. Compact relaxations for polynomial programming problems
# Annabell Berger and Matthias Müller-Hannemann. How to Attack the NP-complete Dag Realization Problem in Practice
# David Manlove and Gregg O'Malley. Paired Kidney Exchange in the UK: Algorithms and Experimentation
# Stelios Joannou and Rajeev Raman. Dynamizing Succinct Tree Representations
# 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
# Alberto Costa and Leo Liberti. Relaxations of multilinear convex envelopes: dual is better than primal
# Ilya Safro, Peter Sanders and Christian Schulz. Advanced Coarsening Schemes for Graph Partitioning
# Amr Elmasry, Jyrki Katajainen and Max Stenmark. Branch Mispredictions Don't Affect Mergesort
# Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Frigioni and Camillo Vitale. Fully Dynamic Maintenance of Arc-Flags in Road Networks
# Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi and Federico Santaroni. Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs
# Farnaz Moradi, Tomas Olovsson and Philippas Tsigas. An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic
# Dominik Kirchler, Leo Liberti and Roberto Wol&#64258;er 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
# Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi and Andrea Marino. On Computing the Diameter of Real-World Directed (Weighted) Graphs
# Guillaume Fertin, Hafedh Mohamed Babou and Irena Rusu. Algorithms for subnetwork mining in heterogeneous networks
# Andrei Negoescu, Gabriel Moruz, Volker Weichert and Christian Neumann. Engineering Efficient Paging Algorithms
# 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
# Pierre Pesneau, Ruslan Sadykov and Francois Vanderbeck. Feasibility Pump Heuristics for Column Generation Approaches
# Annalisa D'Andrea and Guido Proietti. Reoptimizing the strengthened metric TSP on multiple edge weight modifications