Experimental Algorithms - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

35

(FIVE YEARS 0)

H-INDEX

10

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642385261, 9783642385278

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38527-8_30 ◽

2013 ◽

pp. 337-353 ◽

Author(s):

Mathias Weller

Download Full-text

Efficient Computation of Jogging Routes

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38527-8_25 ◽

2013 ◽

pp. 272-283 ◽

Author(s):

Andreas Gemsa ◽

Thomas Pajor ◽

Dorothea Wagner ◽

Tobias Zündorf

Keyword(s):

Efficient Computation

Download Full-text

Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38527-8_1 ◽

2013 ◽

pp. 1-3 ◽

Author(s):

Martin Skutella

Keyword(s):

Linear Programming ◽

Parallel Machines ◽

Unrelated Parallel Machines ◽

Linear Programming Relaxations

Download Full-text

Separable Non-convex Underestimators for Binary Quadratic Programming

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38527-8_22 ◽

2013 ◽

pp. 236-247 ◽

Author(s):

Christoph Buchheim ◽

Emiliano Traversi

Keyword(s):

Quadratic Programming ◽

Convex Underestimators ◽

Binary Quadratic Programming

Download Full-text

Think Locally, Act Globally: Highly Balanced Graph Partitioning

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38527-8_16 ◽

2013 ◽

pp. 164-175 ◽

Author(s):

Peter Sanders ◽

Christian Schulz

Keyword(s):

Graph Partitioning

Download Full-text

Lightweight Lempel-Ziv Parsing

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38527-8_14 ◽

2013 ◽

pp. 139-150 ◽

Author(s):

Juha Kärkkäinen ◽

Dominik Kempa ◽

Simon J. Puglisi

Download Full-text

Faster Customization of Road Networks

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38527-8_5 ◽

2013 ◽

pp. 30-42 ◽

Author(s):

Daniel Delling ◽

Renato F. Werneck

Keyword(s):

Download Full-text

Dominator Certification and Independent Spanning Trees: An Experimental Study

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38527-8_26 ◽

2013 ◽

pp. 284-295 ◽

Author(s):

Loukas Georgiadis ◽

Luigi Laura ◽

Nikos Parotsidis ◽

Robert E. Tarjan

Keyword(s):

Experimental Study ◽

Spanning Trees ◽

Independent Spanning Trees

Download Full-text

Undercover Branching

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38527-8_20 ◽

2013 ◽

pp. 212-223

Author(s):

Timo Berthold ◽

Ambros M. Gleixner

Download Full-text

Branchless Search Programs

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38527-8_13 ◽

2013 ◽

pp. 127-138 ◽

Author(s):

Amr Elmasry ◽

Jyrki Katajainen

Download Full-text