The Discrepancy Method
B. Chazelle
|
8 |
1998 |
8
1998
|
Sorting, Searching, and Simulation in the MapReduce Framework
M. Goodrich,
Nodari Sitchinava,
Qin Zhang
|
7 |
2011 |
7
2011
|
Finding the Medial Axis of a Simple Polygon in Linear Time
F. Chin,
J. Snoeyink,
C. Wang
|
7 |
1995 |
7
1995
|
Pareto Optimality in House Allocation Problems
David J. Abraham,
K. Cechlárová,
D. Manlove,
K. Mehlhorn
|
7 |
2005 |
7
2005
|
Exact Algorithms for Maximum Independent Set
Mingyu Xiao,
H. Nagamochi
|
7 |
2013 |
7
2013
|
Settling the Intractability of Multiple Alignment
Isaac Elias
|
7 |
2003 |
7
2003
|
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array
K. Sadakane
|
7 |
2000 |
7
2000
|
Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots
P. Flocchini,
G. Prencipe,
N. Santoro,
P. Widmayer
|
7 |
1999 |
7
1999
|
On the Advice Complexity of Online Problems
Hans-Joachim Böckenhauer,
D. Komm,
Rastislav Kralovic,
Richard Královic,
Tobias Mömke
|
7 |
2009 |
7
2009
|
Graph Layout Problems Parameterized by Vertex Cover
M. Fellows,
D. Lokshtanov,
Neeldhara Misra,
Frances A. Rosamond,
Saket Saurabh
|
7 |
2008 |
7
2008
|
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
S. Tani,
K. Hamaguchi,
S. Yajima
|
7 |
1993 |
7
1993
|
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
T. Jurdzinski,
Grzegorz Stachowiak
|
6 |
2002 |
6
2002
|
New Inapproximability Bounds for TSP
Marek Karpinski,
M. Lampis,
R. Schmied
|
6 |
2013 |
6
2013
|
Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs
T. Uno
|
6 |
1997 |
6
1997
|
