| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh |
PASS Approximation: A Framework for Analyzing and Designing Heuristics.  |
Algorithmica  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Quentin F. Stout |
Isotonic Regression via Partitioning. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Yngve Villanger |
Proper Interval Vertex Deletion. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Avivit Lazar, Arie Tamir |
Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ching-Chi Lin, Gen-Huey Chen, Gerard J. Chang |
A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ali Çivril, Malik Magdon-Ismail |
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Minghui Jiang |
Recognizing d-Interval Graphs and d-Track Interval Graphs. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Leslie Ann Goldberg |
Adaptive Drift Analysis. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Calabro, Russell Impagliazzo, Ramamohan Paturi |
On the Exact Complexity of Evaluating Quantified k -CNF. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Longkun Guo, Hong Shen |
On Finding Min-Min Disjoint Paths. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Wing-Kin Sung |
Constructing the R* Consensus Tree of Two Trees in Subcubic Time. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Guillemot, Frédéric Havet, Christophe Paul, Anthony Perez |
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Yang Xiang |
How to Use Spanning Trees to Navigate in Graphs. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Yi, Qin Zhang |
Optimal Tracking of Distributed Heavy Hitters and Quantiles. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Lijun Chang, Jeffrey Xu Yu, Lu Qin |
Fast Maximal Cliques Enumeration in Sparse Graphs. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das 0001, Yann Disser, Matús Mihalák, Peter Widmayer |
Mapping Simple Polygons: How Robots Benefit from Looking Back. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Z. Chen, Haitao Wang |
Approximating Points by a Piecewise Linear Function. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Minghui Jiang |
On the Largest Empty Axis-Parallel Box Amidst n Points. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff |
Exact and Parameterized Algorithms for Max Internal Spanning Tree. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Katharina T. Huber, Vincent Moulton |
Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Guillemot, Florian Sikora |
Finding and Counting Vertex-Colored Subtrees. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk, Lionov Wiratma |
Median Trajectories. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann |
Unified Compression-Based Acceleration of Edit-Distance Computation. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin |
Online Clustering with Variable Sized Clusters. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kratsch, Frank Neumann |
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Iwata, Mizuyo Takamatsu |
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik Krohn, Bengt J. Nilsson |
Approximate Guarding of Monotone and Rectilinear Polygons. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Caragiannis |
Efficient Coordination Mechanisms for Unrelated Machine Scheduling. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström |
Parameterized Two-Player Nash Equilibrium. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma |
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Maximum Matching in Regular and Almost Regular Graphs. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis |
Improved Bounds for Finger Search on a RAM. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Bhaskar DasGupta, S. Muthukrishnan |
Stochastic Budget Optimization in Internet Advertising. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | A. García, Pedro Jodrá, Javier Tejel |
Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyriaki Ioannidou, Stavros D. Nikolopoulos |
The Longest Path Problem Is Polynomial on Cocomparability Graphs. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Chung-Shou Liao, D. T. Lee |
Power Domination in Circular-Arc Graphs. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Havet, Leonardo Sampaio |
On the Grundy and b-Chromatic Numbers of a Graph. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro |
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Pestov |
Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Graham Cormode, Michael Mitzenmacher, Justin Thaler |
Streaming Graph Computations with a Helpful Advisor. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Radu Mihaescu, Cameron Hill, Satish Rao |
Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Kuan-Yu Chen, Kun-Mao Chao |
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith |
Sublinear Algorithms for Approximating String Compressibility. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Elias Koutsoupias, Angelina Vidali |
A Lower Bound of 1+φ for Truthful Scheduling Mechanisms. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak |
Collecting Weighted Items from a Dynamic Queue. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | David Peleg, Liam Roditty |
Relaxed Spanners for Directed Disk Graphs. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen |
List Factoring and Relative Worst Order Analysis. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Koufogiannakis, Neal E. Young |
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh |
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh |
Computing Optimal Steiner Trees in Polynomial Space. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Praveen |
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Harish Chandran, Nikhil Gopalkrishnan, John H. Reif |
Tile Complexity of Approximate Squares. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao |
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Chaoyi Pang, Qing Zhang, Xiaofang Zhou, David P. Hansen, Sen Wang, Anthony J. Maeder |
Computing Unrestricted Synopses Under Maximum Error Bound. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh |
Improved Approximation Algorithms for the Spanning Star Forest Problem. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin A. Burton, Melih Ozlen |
A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Nederlof |
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Neelesh Khanna |
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Chien-Chung Huang, Zoya Svitkina |
Donation Center Location Problem. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
The Parameterized Complexity of Unique Coverage and Its Variants. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Bang Ye Wu |
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Shoshana Neuburger, Dina Sokol |
Succinct 2D Dictionary Matching. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | David Doty, Lila Kari, Benoît Masson |
Negative Interactions in Irreversible Self-assembly. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Ildikó Schlotter |
Cleaning Interval Graphs. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio |
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadHossein Bateni, Julia Chuzhoy |
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Hershcovitch, Haim Kaplan |
I/O Efficient Dynamic Data Structures for Longest Prefix Queries. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour |
Two-stage Robust Network Design with Exponential Scenarios. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara |
Route-Enabling Graph Orientation Problems. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong |
Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting |
Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda |
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina, Travis Gagie, Giovanni Manzini |
Lightweight Data Indexing and Compression in External Memory. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani |
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès |
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy |
Complexity of Finding Graph Roots with Girth Conditions. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij |
Fast Algorithms for max independent set. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Danny Hermelin, Frances A. Rosamond |
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bonsma, Felix Breuer |
Counting Hexagonal Patches and Independent Sets in Circle Graphs. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew J. Katz, Gila Morgenstern |
A Scheme for Computing Minimum Covers within Simple Regions. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat |
Layered Working-Set Trees. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mariano Zelke |
Weighted Matching in the Semi-Streaming Model. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yixin Cao, Jianer Chen |
Cluster Editing: Kernelization Based on Edge Cuts. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Sparl, Rafal Witkowski, Janez Zerovnik |
1-Local 7/5-Competitive Algorithm for Multicoloring Hexagonal Graphs. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou |
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Stacho |
3-Colouring AT-Free Graphs in Polynomial Time. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Philippe Flajolet, the Father of Analytic Combinatorics. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav |
Bipartite Matching in the Semi-streaming Model. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Ivanyos, Luc Sanselme, Miklos Santha |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Yoo-Ah Kim, Azarakhsh Malekian |
Improved Approximation Algorithms for Data Migration. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro |
Succinct Representation of Labeled Graphs. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane |
Stronger Lempel-Ziv Based Compressed Text Indexing. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyung-Yong Chwa, Kunsoo Park |
Guest Editorial: Special Issue on Algorithms and Computation. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Fisch Brito, Elias Koutsoupias, Shailesh Vaya |
Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait? |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Youhei Akimoto, Yuichi Nagata, Isao Ono, Shigenobu Kobayashi |
Theoretical Foundation for CMA-ES from Information Geometry Perspective. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Micah Adler, Brent Heeringa |
Approximating Optimal Binary Decision Trees. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Lampis |
Algorithmic Meta-theorems for Restrictions of Treewidth. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Beat Gfeller |
Faster Swap Edge Computation in Minimum Diameter Spanning Trees. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")