Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Jesper Nederlof |
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 868-884, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | David Doty, Lila Kari, Benoît Masson |
Negative Interactions in Irreversible Self-assembly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(1), pp. 153-172, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr |
Inequalities for the Number of Walks in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(4), pp. 804-828, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(1), pp. 51-86, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(3), pp. 605-633, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ferdinando Cicalese, Ely Porat |
Guest Editorial for "Group Testing: models and applications". ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(3), pp. 293-294, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil Bansal 0001, Joel Spencer |
Deterministic Discrepancy Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(4), pp. 451-471, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Dániel Marx, Ildikó Schlotter |
Cleaning Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(2), pp. 275-316, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Gábor Wiener |
Rounds in Combinatorial Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(3), pp. 315-323, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Bhaskar DasGupta, S. Muthukrishnan 0001 |
Stochastic Budget Optimization in Internet Advertising. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(3), pp. 634-661, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh |
PASS Approximation: A Framework for Analyzing and Designing Heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(2), pp. 450-478, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Hung Q. Ngo 0001, Duong Hieu Phan, David Pointcheval |
Black-Box Trace&Revoke Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(3), pp. 418-448, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Shayan Oveis Gharan, Jan Vondrák |
On Variants of the Matroid Secretary Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(4), pp. 472-497, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | M. Praveen |
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 713-753, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann 0001, Stephen G. Kobourov |
Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(1), pp. 3-22, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Chris Calabro, Russell Impagliazzo, Ramamohan Paturi |
On the Exact Complexity of Evaluating Quantified k -CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 817-827, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Chaoyi Pang, Qing Zhang 0001, Xiaofang Zhou 0001, David P. Hansen, Sen Wang 0001, Anthony J. Maeder |
Computing Unrestricted Synopses Under Maximum Error Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(1), pp. 1-42, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Moshe Hershcovitch, Haim Kaplan |
I/O Efficient Dynamic Data Structures for Longest Prefix Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(2), pp. 371-390, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Peter Damaschke, Azam Sheikh Muhammad, Eberhard Triesch |
Two New Perspectives on Multi-Stage Group Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(3), pp. 324-354, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Sylvain Guillemot, Florian Sikora |
Finding and Counting Vertex-Colored Subtrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 828-844, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Steven M. Kautz, Brad Shutters |
Self-Assembling Rulers for Approximating Generalized Sierpinski Carpets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(2), pp. 207-233, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Bang Ye Wu |
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(2), pp. 467-479, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai |
On Total Unimodularity of Edge-Edge Adjacency Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(2), pp. 277-292, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(1), pp. 43-59, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Neeldhara Misra, Hannes Moser, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar |
The Parameterized Complexity of Unique Coverage and Its Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(3), pp. 517-544, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Alfredo García Olaverri, Pedro Jodrá, Javier Tejel |
Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(3), pp. 481-497, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 772-801, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz |
Unbounded Contention Resolution in Multiple-Access Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(3), pp. 295-314, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Elias Koutsoupias, Angelina Vidali |
A Lower Bound of 1+φ for Truthful Scheduling Mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(1), pp. 211-223, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Vikraman Arvind, Johannes Köbler |
The Parallel Complexity of Graph Canonization Under Abelian Group Action. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(2), pp. 247-276, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Graham Cormode, Michael Mitzenmacher, Justin Thaler |
Streaming Graph Computations with a Helpful Advisor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(2), pp. 409-442, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Chien-Chung Huang, Zoya Svitkina |
Donation Center Location Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(1), pp. 187-210, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Katharina T. Huber, Vincent Moulton |
Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(3), pp. 714-738, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono 0001, Hisao Tamaki, Ryuhei Uehara |
Route-Enabling Graph Orientation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(2), pp. 317-338, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Danny Z. Chen, Haitao Wang 0001 |
Approximating Points by a Piecewise Linear Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(3), pp. 682-713, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Avivit Lazar, Arie Tamir |
Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(3), pp. 615-640, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Fabrizio Grandoni 0001, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh 0001 |
Computing Optimal Steiner Trees in Polynomial Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(3), pp. 584-604, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesh Raman 0001, Saket Saurabh 0001 |
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 711-712, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Michael Huber 0002 |
Efficient Two-Stage Group Testing Algorithms for Genetic Screening. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(3), pp. 355-367, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ning Chen 0005, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh |
Improved Approximation Algorithms for the Spanning Star Forest Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(3), pp. 498-516, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Vladimir Pestov |
Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(2), pp. 310-328, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Osamu Watanabe 0001 |
Message Passing Algorithms for MLS-3LIN Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(4), pp. 848-868, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Jesper Jansson 0001, Wing-Kin Sung |
Constructing the R* Consensus Tree of Two Trees in Subcubic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(2), pp. 329-345, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Feodor F. Dragan, Yang Xiang |
How to Use Spanning Trees to Navigate in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(3), pp. 479-511, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Hsien-Kuei Hwang, Conrado Martínez, Robert Sedgewick |
Guest Editorial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(4), pp. 739-740, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Narayan Vikas |
Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(2), pp. 180-206, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Shoshana Neuburger, Dina Sokol |
Succinct 2D Dictionary Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(3), pp. 662-684, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler |
External-Memory Multimaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(1), pp. 23-48, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Yaw-Ling Lin, Charles B. Ward, Steven Skiena |
Synthetic Sequence Design for Signal Location Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(3), pp. 368-383, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Lauri Ahlroth, Olli Pottonen, André Schumacher |
Approximately Uniform Online Checkpointing with Bounded Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(2), pp. 234-246, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Paolo Ferragina, Jouni Sirén, Rossano Venturini |
Distribution-Aware Compressed Full-Text Indexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(4), pp. 529-546, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(3), pp. 595-614, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ali Çivril, Malik Magdon-Ismail |
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(1), pp. 159-176, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | MohammadHossein Bateni, Julia Chuzhoy |
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(3), pp. 545-561, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Frédéric Havet, Leonardo Sampaio Rocha |
On the Grundy and b-Chromatic Numbers of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 885-899, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(2), pp. 354-370, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin |
Online Clustering with Variable Sized Clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(2), pp. 251-274, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | David Peleg, Liam Roditty |
Relaxed Spanners for Directed Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(1), pp. 146-158, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Michael Drmota, Konstantinos Panagiotou |
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(4), pp. 741-761, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Pim van 't Hof, Yngve Villanger |
Proper Interval Vertex Deletion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 845-867, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Camil Demetrescu, Magnús M. Halldórsson |
Editorial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(4), pp. 449-450, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Quentin F. Stout |
Isotonic Regression via Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(1), pp. 93-112, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann |
Unified Compression-Based Acceleration of Edit-Distance Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(2), pp. 339-353, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Satoru Iwata 0001, Mizuyo Takamatsu |
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(2), pp. 346-368, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Mahdi Cheraghchi |
Improved Constructions for Non-adaptive Threshold Group Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(3), pp. 384-417, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Sylvain Guillemot, Frédéric Havet, Christophe Paul, Anthony Perez 0001 |
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 900-926, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Kratsch, Frank Neumann 0001 |
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 754-771, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Chung-Shou Liao, D. T. Lee |
Power Domination in Circular-Arc Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(2), pp. 443-466, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(2), pp. 369-396, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Doerr, Leslie Ann Goldberg |
Adaptive Drift Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(1), pp. 224-250, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ahmed Helmi 0001, Alois Panholzer |
Analysis of the "Hiring Above the Median" Selection Strategy for the Hiring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(4), pp. 762-803, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker |
FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(2), pp. 142-160, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | |
Editorial Note. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(2), pp. 111, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(1), pp. 18-50, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro |
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(3), pp. 562-583, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Tobias Friedrich 0001, Thomas Sauerwald, Alexandre Stauffer |
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(1), pp. 65-88, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ke Yi 0001, Qin Zhang 0001 |
Optimal Tracking of Distributed Heavy Hitters and Quantiles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(1), pp. 206-223, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001 |
Derandomizing the HSSW Algorithm for 3-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(2), pp. 112-124, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou 0001 |
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(2), pp. 161-179, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin |
Motion Planning via Manifold Samples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(4), pp. 547-565, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Stephan G. Wagner |
Asymptotic Enumeration of Extensional Acyclic Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(4), pp. 829-847, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström |
Parameterized Two-Player Nash Equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 802-816, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ely Porat, Liam Roditty |
Preprocess, Set, Query! ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(4), pp. 516-528, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Radu Mihaescu, Cameron Hill, Satish Rao |
Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(2), pp. 419-449, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto |
Guest Editorial: Selected Papers from ISAAC 2011. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(1), pp. 1-2, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao |
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(2), pp. 397-418, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(1), pp. 60-94, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Raphael Yuster |
Maximum Matching in Regular and Almost Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(1), pp. 87-92, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 66(2), pp. 249-286, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità |
The School Bus Problem on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(1), pp. 49-64, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Takehiro Ito, Takao Nishizeki, Michael Schröder 0001, Takeaki Uno, Xiao Zhou 0001 |
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 62(3-4), pp. 823-841, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès |
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 63(1-2), pp. 551-567, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers |
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 62(1-2), pp. 595-629, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Joachim von zur Gathen, Daniel Panario, L. Bruce Richmond |
Interval Partitions and Polynomial Factorization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 63(1-2), pp. 363-397, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff 0001 |
Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 62(1-2), pp. 309-332, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Qi Ge, Daniel Stefankovic |
The Complexity of Counting Eulerian Tours in 4-regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 63(3), pp. 588-601, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Kyung-Yong Chwa, Kunsoo Park |
Guest Editorial: Special Issue on Algorithms and Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 64(3), pp. 327-328, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Qian-Ping Gu, Hisao Tamaki |
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 64(3), pp. 416-453, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Michael L. Fredman |
Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 62(3-4), pp. 863-878, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Christian A. Duncan, Emden R. Gansner, Yifan Hu 0001, Michael Kaufmann 0001, Stephen G. Kobourov |
Optimal Polygonal Representation of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 63(3), pp. 672-691, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|