| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki |
Adversarial Queuing on the Multiple Access Channel.  |
ACM Transactions on Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Böcker, Quang Bao Anh Bui, Anke Truß |
Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk |
Even Faster Exact Bandwidth. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Matteo Frigo, Charles E. Leiserson, Harald Prokop, Sridhar Ramachandran |
Cache-Oblivious Algorithms. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey |
On approximating multicriteria TSP. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Yang Liu, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang |
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihiro Fujito |
How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuli Ye, Allan Borodin |
Elimination graphs. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi |
Online Optimization with Uncertain Information. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman, Orly Yahalom |
On the query complexity of testing orientations for being Eulerian. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam |
The price of anarchy in network creation games. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sudipto Guha, Kamesh Munagala |
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Yi, Qin Zhang |
Multidimensional online tracking. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Krokhin, Dániel Marx |
On the hardness of losing weight. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin |
Succinct geometric indexes supporting point location queries. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini |
Dotted interval graphs. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan |
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Reinhard Kutzelnigg |
A precise analysis of Cuckoo hashing. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
The traveling salesman problem in bounded degree graphs. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Don Coppersmith, Tomasz Nowicki, Giuseppe Paleologo, Charles Philippe Tresser, Chai Wah Wu |
The optimality of the online greedy algorithm in carpool and chairman assignment problems. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote |
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Edmonds, Kirk Pruhs |
Cake cutting really is not a piece of cake. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller |
Broadcast scheduling: Algorithms and complexity. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Azarakhsh Malekian, Julián Mestre |
To fill or not to fill: The gas station problem. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti |
Succinct indexes for strings, binary relations and multilabeled trees. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie |
Minimizing flow time in the wireless gathering problem. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zachary Friggstad, Mohammad R. Salavatipour |
Minimizing movement in mobile facility location problems. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang |
Tree exploration with logarithmic memory. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev |
Set connectivity problems in undirected graphs and the directed steiner network problem. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yongwook Choi, Wojciech Szpankowski |
Constrained pattern matching. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Marco Molinaro |
Improved approximations for the hotlink assignment problem. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Fotakis |
Memoryless facility location in one pass. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Asaf Shapira |
All-pairs shortest paths with a sublinear additive error. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shlomo Moran, Sagi Snir, Wing-Kin Sung |
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang, Yong Zhang |
A new upper bound 2.5545 on 2D Online Bin Packing. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania |
Decision trees for entity identification: Approximation algorithms and hardness results. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, David Cashman, Avner Magen |
How well can primal-dual and local-ratio algorithms perform? |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Evangelos Kranakis, Danny Krizanc, Pat Morin |
Randomized rendezvous with limited memory. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Burkhard Monien, Karsten Tiemann |
Routing (un-) splittable flow in games with player-specific affine latency functions. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bin Fu, Ming-Yang Kao, Lusheng Wang |
Discovering almost any hidden motif from multiple sequences. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ge Nong, Sen Zhang, Wai Hong Chan |
Computing the inverse sort transform in linear time. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani |
An improved approximation algorithm for resource allocation. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Pritchard, Ramakrishna Thurimella |
Fast computation of small cuts via cycle space sampling. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Izsak, Nicholas Pippenger |
Carry propagation in multiplication by constants. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée |
Philippe flajolet, the father of analytic combinatorics. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas |
Three-coloring triangle-free planar graphs in linear time. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Éric Colin de Verdière, Alexander Schrijver |
Shortest vertex-disjoint two-face paths in planar graphs. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bonsma, Frederic Dorn |
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai-Min Chung, Omer Reingold, Salil P. Vadhan |
S-T connectivity on digraphs with a known stationary distribution. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Adi Rosén, Gabriel Scalosub |
Rate vs. buffer size-greedy information gathering on the line. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin |
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan |
Max-coloring and online coloring with bandwidths on interval graphs. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira |
Fully compressed suffix trees. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Graham Cormode, S. Muthukrishnan, Ke Yi |
Algorithms for distributed functional monitoring. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko |
Sum edge coloring of multigraphs via configuration LP. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur |
Finding witnesses by peeling. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck |
Data structures for mergeable trees. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Avraham Ben-Aroya, Sivan Toledo |
Competitive analysis of flash memory algorithms. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
The tree inclusion problem: In linear space and faster. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Jacobs |
Constant factor approximations for the hotlink assignment problem. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ignaz Rutter, Alexander Wolff |
Computing large matchings fast. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
Additive spanners and (alpha, beta)-spanners. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani |
Fast asynchronous Byzantine agreement and leader election with full information. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcel R. Ackermann, Johannes Blömer, Christian Sohler |
Clustering for metric and nonmetric distance measures. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Atlas F. Cook, Carola Wenk |
Geodesic Fréchet distance inside a simple polygon. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella |
Length-bounded cuts and flows. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman |
Labeling schemes for vertex connectivity. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Drescher, Adrian Vetta |
An approximation algorithm for the maximum leaf spanning arborescence problem. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez |
Approximating corridors and tours via restriction and relaxation techniques. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Gordon, Adi Rosén |
Competitive weighted throughput analysis of greedy protocols on DAGs. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska Williams |
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar |
Finding one tight cycle. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Aminof, Orna Kupferman, Robby Lampert |
Reasoning about online algorithms with weighted automata. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Shalita, Uri Zwick |
Efficient algorithms for the 2-gathering problem. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reid Andersen |
A local algorithm for finding dense subgraphs. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shahar Fattal, Dana Ron |
Approximating the distance to monotonicity in high dimensions. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Ruskey, Aaron Williams |
An explicit universal cycle for the (n-1)-permutations of an n-set. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce A. Bobier, Joe Sawada |
A fast algorithm to generate open meandric systems and meanders. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish Goel, Michael Kapralov, Sanjeev Khanna |
Perfect matchings via uniform sampling in regular bipartite graphs. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti, Graham Cormode, Andrew McGregor |
A near-optimal algorithm for estimating the entropy of a stream. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Comparison-based time-space lower bounds for selection. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Shay Kutten, Boaz Patt-Shamir |
Distributed error confinement. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jie Gao, Michael Langberg, Leonard J. Schulman |
Clustering lines in high-dimensional space: Classification of incomplete data. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip N. Klein, Shay Mozes, Oren Weimann |
Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Shai Gutner |
Balanced families of perfect hash functions and their applications. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos |
Taxes for linear atomic congestion games. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantinos Panagiotou, Angelika Steger |
Maximal biconnected subgraphs of random planar graphs. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp |
Periodicity testing with sublinear samples and space. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang |
Hausdorff distance under translation for points and balls. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, David Peleg, Liam Roditty |
A near-linear-time algorithm for computing replacement paths in planar directed graphs. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Claire Mathieu |
Foreword to special issue SODA 2009. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Madani, Mikkel Thorup, Uri Zwick |
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | John Gunnar Carlsson, Benjamin Armbruster, Yinyu Ye |
Finding equitable convex partitions of points in a polygon efficiently. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
Finding heaviest H-subgraphs in real weighted graphs, with applications. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | George Christodoulou, Elias Koutsoupias, Annamária Kovács |
Mechanism design for fractional scheduling on unrelated machines. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Shang-Hua Teng |
Foreword to special issue on SODA 2008. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Conrado Martínez, Daniel Panario, Alfredo Viola |
Adaptive sampling strategies for quickselects. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Steve Oudot, Leonidas J. Guibas, Jie Gao, Yue Wang |
Geodesic delaunay triangulations in bounded planar domains. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Flammini, Gaia Nicosia |
On the bicriteria k-server problem. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina, Rossano Venturini |
The compressed permuterm index. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")