The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Algorithmica"( http://dblp.L3S.de/Venues/Algorithmica )

URL (DBLP): http://dblp.uni-trier.de/db/journals/algorithmica

Publication years (Num. hits)
1986 (29) 1987 (27) 1988 (26) 1989 (36) 1990 (33) 1991 (47) 1992 (57) 1993 (58) 1994 (60) 1995 (54) 1996 (68) 1997 (79) 1998 (73) 1999 (68) 2000 (73) 2001 (89) 2002 (95) 2003 (82) 2004 (53) 2005 (46) 2006 (77) 2007 (77) 2008 (79) 2009 (96) 2010 (125) 2011 (133) 2012 (118)
Publication types (Num. hits)
article(1858)
Venues (Conferences, Journals, ...)
Algorithmica(1858)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1597 occurrences of 761 keywords

Results
Found 1858 publication records. Showing 1858 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Paolo Ferragina, Travis Gagie, Giovanni Manzini Lightweight Data Indexing and Compression in External Memory. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy Complexity of Finding Graph Roots with Girth Conditions. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij Fast Algorithms for max independent set. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Danny Hermelin, Frances A. Rosamond Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Paul Bonsma, Felix Breuer Counting Hexagonal Patches and Independent Sets in Circle Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Matthew J. Katz, Gila Morgenstern A Scheme for Computing Minimum Covers within Simple Regions. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Seok-Hee Hong, Hiroshi Nagamochi A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat Layered Working-Set Trees. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mariano Zelke Weighted Matching in the Semi-Streaming Model. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yixin Cao, Jianer Chen Cluster Editing: Kernelization Based on Edge Cuts. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1 Philippe Flajolet, the Father of Analytic Combinatorics. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav Bipartite Matching in the Semi-streaming Model. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gábor Ivanyos, Luc Sanselme, Miklos Santha An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Samir Khuller, Yoo-Ah Kim, Azarakhsh Malekian Improved Approximation Algorithms for Data Migration. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro Succinct Representation of Labeled Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane Stronger Lempel-Ziv Based Compressed Text Indexing. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Micah Adler, Brent Heeringa Approximating Optimal Binary Decision Trees. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael Lampis Algorithmic Meta-theorems for Restrictions of Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Beat Gfeller Faster Swap Edge Computation in Minimum Diameter Spanning Trees. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1David Coudert, Florian Huc, Dorian Mazauric A Distributed Algorithm for Computing the Node Search Number in Trees. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Liam Roditty Fully Dynamic Geometric Spanners. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Daniel Panario, L. Bruce Richmond Interval Partitions and Polynomial Factorization. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sergio Cabello Many Distances in Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vida Dujmovic, John Howat, Pat Morin Biased Range Trees. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy Approximability of the Firefighter Problem - Computing Cuts over Time. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh Finding Maximum Edge Bicliques in Convex Bipartite Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Telikepalli Kavitha Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Philip Bille, Inge Li Gørtz Fast Arc-Annotated Subsequence Matching in Linear Space. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu Caching Is Hard - Even in the Fault Model. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jens M. Schmidt Construction Sequences and Certifying 3-connectivity. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky Maximum Series-Parallel Subgraph. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel Binkele-Raible, Henning Fernau An Exact Exponential Time Algorithm for Power Dominating Set. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi On Smoothed Analysis of Quicksort and Hoare's Find. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael L. Fredman Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gokarna Sharma, Costas Busch A Competitive Analysis for Balanced Transactional Memory Workloads. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos Fast Minor Testing in Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Dieter Kratsch, Mathieu Liedloff On Independent Sets and Bicliques in Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Donglei Du, Ruixing Lu, Dachuan Xu A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen Parameterized Complexity of the Spanning Tree Congestion Problem. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Scott M. Summers Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alexander E. Holroyd, Frank Ruskey, Aaron Williams Shorthand Universal Cycles for Permutations. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Nguyen Kim Thang Tile-Packing Tomography Is $\mathbb{NP}$ -hard. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nicolas 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 Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Raphael Yuster Almost Exact Matchings. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1MohammadHossein Bateni, MohammadTaghi Hajiaghayi Euclidean Prize-Collecting Steiner Forest. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel Binkele-Raible, Henning Fernau Parameterized Measure & Conquer for Problems with No Small Kernels. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar The Parameterized Complexity of Stabbing Rectangles. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Leah Epstein, Asaf Levin, Rob van Stee Approximation Schemes for Packing Splittable Items with Cardinality Constraints. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alexandr O. Ivanov, Alexey A. Tuzhilin The Steiner Ratio Gilbert-Pollak Conjecture Is Still Open - Clarification Statement. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1René van Bevern, Hannes Moser, Rolf Niedermeier Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hee-Kap Ahn, Otfried Cheong Aligning Two Convex Figures to Minimize Area or Perimeter. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz Local Search Algorithms for the Red-Blue Median Problem. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Paola Flocchini, David Ilcinkas, Nicola Santoro Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Fabrizio Grandoni, Daniel Lokshtanov, Saket Saurabh Sharp Separation and Applications to Exact and Parameterized Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dániel Marx, Ildikó Schlotter Obtaining a Planar Graph by Vertex Deletion. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao On Space Efficient Two Dimensional Range Minimum Data Structures. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Imran A. Pirwani, Mohammad R. Salavatipour A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vincenzo Bonifaci, Alberto Marchetti-Spaccamela Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Olivier Bernardi, Éric Fusy Schnyder Decompositions for Regular Plane Graphs and Application to Drawing. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alireza Zarei, Mohammad Ghodsi Efficient Observer-Dependent Simplification in Polygonal Domains. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pim van 't Hof, Marcin Kaminski, Daniël Paulusma Finding Induced Paths of Given Parity in Claw-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alejandro López-Ortiz Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Piotr Berman, Marek Karpinski, Andrzej Lingas Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Andreas Krebs, Nutan Limaye, Meena Mahajan Counting Paths in VPA Is Complete for #NC 1. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sherman S. M. Chow, Changshe Ma, Jian Weng Zero-Knowledge Argument for Simultaneous Discrete Logarithms. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jing Xiao, Tiancheng Lou, Tao Jiang An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch Polynomial Kernelizations for MIN F+Π1 and MAX NP. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth The Power of Fair Pricing Mechanisms. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty f-Sensitivity Distance Oracles and Routing Schemes. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Elliot Anshelevich, Martin Hoefer Contribution Games in Networks. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Patrick Briest, Martin Hoefer, Piotr Krysta Stackelberg Network Pricing Games. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Tobias Jacobs On the Complexity of Optimal Hotlink Assignment. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1My T. Thai Guest Editorial: Computing and Combinatorics. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mark van Hoeij, Andrew Novocin Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Frank Dehne, Masoud T. Omran, Jörg-Rüdiger Sack Shortest Paths in Time-Dependent FIFO Networks. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alexander Kesselman, Kirill Kogan, Michael Segal Improved Competitive Performance Bounds for CIOQ Switches. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha On the Hitting Times of Quantum Versus Random Walks. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1André Berger, Ojas Parekh Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Leah Epstein, Asaf Levin On Equilibria for ADM Minimization Games. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Craig Dillabaugh, Meng He, Anil Maheshwari Succinct and I/O Efficient Data Structures for Traversal in Trees. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pankaj K. Agarwal, Esther Ezra, Micha Sharir Near-Linear Approximation Algorithms for Geometric Hitting Sets. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Adrian Dumitrescu, Minghui Jiang Minimum-Perimeter Intersecting Polygons. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Petra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, Zengjian Hu Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mark de Berg Guest Editorial. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao External Memory Planar Point Location with Logarithmic Updates. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Britta Dorn, Ildikó Schlotter Multivariate Complexity Analysis of Swap Bribery. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Chandra Chekuri, Nitish Korula Pruning 2-Connected Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Olivier Bernardi, Omer Giménez A Linear Algorithm for the Random Sampling from Regular Languages. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1858 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.