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 (53) 2004 (74) 2005 (54) 2006 (77) 2007 (77) 2008 (79) 2009 (96) 2010 (125) 2011 (133) 2012 (136) 2013 (108) 2014 (119) 2015 (130) 2016 (146) 2017 (158) 2018 (164) 2019 (161) 2020 (140) 2021 (129) 2022 (140) 2023 (137) 2024 (58)
Publication types (Num. hits)
article(3466)
Venues (Conferences, Journals, ...)
Algorithmica(3466)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1597 occurrences of 761 keywords

Results
Found 3466 publication records. Showing 3466 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Travis Gagie, Meng He 0001, Gonzalo Navarro 0001 Compressed Dynamic Range Majority and Minority Data Structures. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Bhaskar DasGupta, Mano Vikash Janardhanan, Farzane Yahyanejad Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures). Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond On the Tractability of Optimization Problems on H-Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal 0001, Pallavi Jain 0001, Lawqueen Kanesh, Saket Saurabh 0001 Parameterized Complexity of Conflict-Free Matchings and Paths. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth Reachability Oracles for Directed Transmission Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001 A Polynomial Sized Kernel for Tracking Paths Problem. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Shi Li 0001, Jinhui Xu 0001, Minwei Ye Approximating Global Optimum for Probabilistic Truth Discovery. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Christophe Paul, Michal Pilipczuk Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1David Eppstein, Elham Havvaei Parameterized Leaf Power Recognition via Embedding into Graph Products. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Aritra Banik, Fahad Panolan, Venkatesh Raman 0001, Vibha Sahlot, Saket Saurabh 0001 Parameterized Complexity of Geometric Covering Problems Having Conflicts. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski Dynamic and Internal Longest Common Substring. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1George B. Mertzios, André Nichterlein, Rolf Niedermeier The Power of Linear-Time Data Reduction for Maximum Matching. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Clemens Heuberger, Daniel Krenn Asymptotic Analysis of Regular Sequences. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Svante Janson Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Gerardo Berbeglia, Gwenaël Joret Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, Arne Schmidt 0001 Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes Sequential Metric Dimension. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos Parameterized Aspects of Strong Subgraph Closure. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Radoslav Fulek Embedding Graphs into Embedded Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho Weak Coverage of a Rectangular Barrier. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Casper Benjamin Freksen, Kasper Green Larsen On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, George Manoussakis, Michael L. Pinedo, Dvir Shabtay, Liron Yedidsion Parameterized Multi-Scenario Single-Machine Scheduling Problems. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Haris Aziz 0001, Péter Biró 0001, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari Stable Matching with Uncertain Linear Preferences. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Torben Hagerup Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Jean Cardinal, Jerri Nummenpalo, Emo Welzl Solving and Sampling with Many Solutions. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Diptapriyo Majumdar, M. S. Ramanujan 0001, Saket Saurabh 0001 On the Approximate Compressibility of Connected Vertex Cover. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Keshav Goyal, Tobias Mömke Robust Reoptimization of Steiner Trees. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés The Inverse Voronoi Problem in Graphs I: Hardness. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Roland Glück, Dominik Köppl Computational Aspects of Ordered Integer Partitions with Bounds. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Refael Hassin, R. Ravi 0001, F. Sibel Salman, Danny Segev The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Lars Jaffke, O-joung Kwon, Jan Arne Telle Mim-Width II. The Feedback Vertex Set Problem. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg A Unified Model and Algorithms for Temporal Map Labeling. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman Embedding Small Digraphs and Permutations in Binary Trees and Split Trees. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Arnab Ganguly 0002, Rahul Shah 0001, Sharma V. Thankachan Succinct Non-overlapping Indexing. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Simone Faro, Francesco Pio Marino, Arianna Pavone Efficient Online String Matching Based on Characters Distance Text Sampling. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Eunjin Oh 0001, Luis Barba, Hee-Kap Ahn The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Hu Ding, Jinhui Xu 0001 A Unified Framework for Clustering Constrained Data Without Locality Property. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Titouan Carette, Mathieu Laurière, Frédéric Magniez Extended Learning Graphs for Triangle Finding. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson Online Clique Clustering. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Shaohua Li 0005, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström Multi-budgeted Directed Cuts. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Thore Husfeldt, Måns Magnusson Multivariate Analysis of Orthogonal Range Searching and Graph Distances. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1David Avis, Luc Devroye An Analysis of Budgeted Parallel Search on Conditional Galton-Watson Trees. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Peter Damaschke Dividing Splittable Goods Evenly and With Limited Fragmentation. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Naoyuki Kamiyama The Distance-Constrained Matroid Median Problem. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Chih-Hung Liu 0001 A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Ankit Chauhan, Tobias Friedrich 0001, Ralf Rothenberger Greed is Good for Deterministic Scale-Free Networks. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Vincenzo Bonifaci On the Convergence Time of a Natural Dynamics for Linear Programming. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Zengfeng Huang, Ke Yi 0001, Qin Zhang 0001 Correction to: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang 0005 On Scheduling Coflows. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Torsten Mütze, Jerri Nummenpalo A Constant-Time Algorithm for Middle Levels Gray Codes. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Moritz Baum, Julian Dibbelt, Thomas Pajor, Jonas Sauer, Dorothea Wagner, Tobias Zündorf Energy-Optimal Routes for Battery Electric Vehicles. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Ildikó Schlotter Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Stefano Coniglio, Nicola Gatti 0001, Alberto Marchesi 0001 Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Zeta Avarikioti, Ioannis Z. Emiris, Loukas Kavouras, Ioannis Psarros High-Dimensional Approximate r-Nets. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono 0001, Yota Otachi Independent Set Reconfiguration Parameterized by Modular-Width. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Krzysztof Turowski, Abram Magner, Wojciech Szpankowski Compression of Dynamic Graphs Generated by a Duplication Model. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Gregor Matl, Stanislav Zivný Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Niels Grüttemeier, Christian Komusiewicz On the Relation of Strong Triadic Closure and Cluster Deletion. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Kohei Hayashi, Yuichi Yoshida Testing Proximity to Subspaces: Approximate ℓ ∞ Minimization in Constant Time. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Gilad Kutiel, Dror Rawitz Local Search Algorithms for the Maximum Carpool Matching Problem. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal 0001, Martin Böhm 0001, Marek Eliás 0001, Grigorios Koumoutsos, Seeun William Umboh Nested Convex Bodies are Chaseable. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Robert Chiang, Kanstantsin Pashkovich On the Approximability of the Stable Matching Problem with Ties of Size Two. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Paulina Grzegorek, Janusz Januszewski, Lukasz Zielonka Efficient 1-Space Bounded Hypercube Packing Algorithm. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu 0001 Online Stochastic Matching: New Algorithms and Bounds. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Boris Aronov, Mark de Berg, Aleksandar Markovic 0001, Gerhard J. Woeginger Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Kustaa Kangas, Mikko Koivisto, Sami Salonen A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Harel Yedidsion, Stav Ashur, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal 0001 Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Johanna E. Preißer, Jens M. Schmidt Computing Vertex-Disjoint Paths in Large Graphs Using MAOs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Siu-Wing Cheng, Kai Jin, Lie Yan Extensions of Self-Improving Sorters. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Júlio Araújo 0001, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva 0001 On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Manouchehr Zaker A New Vertex Coloring Heuristic and Corresponding Chromatic Number. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Yoshio Okamoto Guest Editorial: Selected Papers from ISAAC 2017. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Ching-Chi Lin, Keng-Chu Ku, Chan-Hung Hsu Paired-Domination Problem on Distance-Hereditary Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Júlio Araújo 0001, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva 0001 Dual Parameterization of Weighted Coloring. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1John Hershberger 0001, Neeraj Kumar 0004, Subhash Suri Shortest Paths in the Plane with Obstacle Violations. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1An Zhang 0001, Yong Chen 0002, Zhi-Zhong Chen, Guohui Lin Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino 0001, Luca Versari Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Stefan Edelkamp, Armin Weiß, Sebastian Wild QuickXsort: A Fast Sorting Scheme in Theory and Practice. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Tatsuya Matsuoka, Shun Sato 0001 Making Bidirected Graphs Strongly Connected. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Michel Habib, Lalla Mouatadid Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Feng Shi 0003, Martin Schirneck, Tobias Friedrich 0001, Timo Kötzing, Frank Neumann 0001 Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli Upward Planar Morphs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1J. Ian Munro, Gonzalo Navarro 0001, Yakov Nekrich Fast Compressed Self-indexes with Deterministic Linear-Time Construction. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Merav Parter, David Peleg Fault Tolerant Approximate BFS Structures with Additive Stretch. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger Deterministic Dynamic Matching in O(1) Update Time. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Yu Yokoi Envy-Free Matchings with Lower Quotas. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Yoad Zur, Michael Segal 0001 Improved Solution to Data Gathering with Mobile Mule. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse On the Complexity of Computing Treebreadth. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Sarah Blind, Kolja Knauer, Petru Valicov Enumerating k-Arc-Connected Orientations. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Dmitry Kosolobov, Daniel Valenzuela 0001, Gonzalo Navarro 0001, Simon J. Puglisi Lempel-Ziv-Like Parsing in Small Space. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Dogan Corus, Pietro S. Oliveto On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Yuichi Nagata, Shinji Imahori An Efficient Exhaustive Search Algorithm for the Escherization Problem. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
Displaying result #501 - #600 of 3466 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license