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
1Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin Batch Coloring of Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andrzej Lingas, Mia Persson Extreme Witnesses and Their Applications. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel König, Markus Lohrey Evaluation of Circuits Over Nilpotent and Polycyclic Groups. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Steven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta The Partial Visibility Representation Extension Problem. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza A General Bin Packing Game: Interest Taken into Account. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin Böhm 0001, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý 0001 Colored Bin Packing: Online Algorithms and Lower Bounds. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide Towards Flexible Demands in Online Leasing Problems. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Wiebke Höhn, Julián Mestre, Andreas Wiese How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cristina G. Fernandes, Rafael Crivellari Saliba Schouery Approximation Algorithms for the Max-Buying Problem with Limited Supply. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Gennaro Cordasco, Luisa Gargano, Marco Mecchia, Adele A. Rescigno, Ugo Vaccaro Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Susanne Albers, Dario Frascaria Quantifying Competitiveness in Paging with Locality of Reference. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cameron T. Chalk, Eric Martinez, Robert T. Schweller, Luis Vega, Andrew Winslow, Tim Wylie Optimal Staged Self-Assembly of General Shapes. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Saket Saurabh 0001 Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yasushi Kawase, Atsushi Miyauchi 0001 The Densest Subgraph Problem with a Convex/Concave Size Function. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh An Improved Approximation Algorithm for Knapsack Median Using Sparsification. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bhaskar DasGupta, Marek Karpinski, Nasim Mobasheri, Farzane Yahyanejad Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Joseph Cheriyan, Zhihan Gao 0002 Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Stefan Woltran Complexity of Secure Sets. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alberto Policriti, Nicola Prezza LZ77 Computation Based on the Run-Length Encoded BWT. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Minghui Jiang 0001 Trees, Paths, Stars, Caterpillars and Spiders. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Timo Kötzing, Dirk Sudholt Preface to the Special Issue on Theory of Genetic and Evolutionary Computation. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Maryam Aliakbarpour, Amartya Shankha Biswas, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Evangelos Kranakis, Gonzalo Navarro 0001 Guest Editorial: Special Issue on Theoretical Informatics. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andreas Wiese Independent Set of Convex Polygons: From $$n^{\epsilon }$$ n ϵ to $$1+\epsilon $$ 1 + ϵ via Shrinking. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Klaus Jansen, Kati Land, Marten Maack Estimating the Makespan of the Two-Valued Restricted Assignment Problem. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath Ortho-polygon Visibility Representations of Embedded Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ildikó Schlotter, Katarína Cechlárová Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat? Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati Strip Planarity Testing for Embedded Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Hanna Sumita, Naonori Kakimura, Kazuhisa Makino Parameterized Complexity of Sparse Linear Complementarity Problems. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bert Besser, Matthias Poloczek Greedy Matching: Guarantees and Limitations. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Duc-Cuong Dang, Thomas Jansen 0001, Per Kristian Lehre Populations Can Be Essential in Tracking Dynamic Optima. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jannis Bulian, Anuj Dawar Fixed-Parameter Tractable Distances to Sparse Graph Classes. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Itai Dinur, Gaëtan Leurent Improved Generic Attacks Against Hash-Based MACs and HAIFA. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik Robustness of the Rotor-Router Mechanism. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Amotz Bar-Noy, Ben Baumer, Dror Rawitz Set It and Forget It: Approximating the Set Once Strip Cover Problem. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Graf 0001 How to Sort by Walking and Swapping on Paths and Trees. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth On the Impossibility of Cryptography with Tamperable Randomness. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen String Powers in Trees. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ashley Montanaro Quantum Pattern Matching Fast on Average. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Reuven Bar-Yehuda, Michael Beder, Dror Rawitz A Constant Factor Approximation Algorithm for the Storage Allocation Problem. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Dinitz, Michael Schapira, Asaf Valadarsky Explicit Expanding Expanders. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza Scalable Zero Knowledge Via Cycles of Elliptic Curves. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yossi Azar, Oren Gilon Scheduling with Deadlines and Buffer Management with Processing Requirements. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Gregory Kucherov, Yakov Nekrich Full-Fledged Real-Time Indexing for Constant Size Alphabets. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil Extending Partial Representations of Interval Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1 Editor's Note: Special Issue on Combinatorial Pattern Matching. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Carola Doerr, Johannes Lengler OneMax in Black-Box Models with Several Restrictions. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Shun Sato 0001 Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of Minors. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal 0001, Irene Finocchi Guest Editors' Foreword. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Lukás Folwarczný, Jirí Sgall General Caching Is Hard: Even with Small Pages. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama Efficiently Correcting Matrix Products. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang Convex Hulls Under Uncertainty. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda Efficient Computation of Substring Equivalence Classes with Suffix Arrays. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1S. Thomas McCormick, Britta Peis, José Verschae, Andreas Wierz Primal-Dual Algorithms for Precedence Constrained Covering Problems. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Khaled M. Elbassioni, Kazuhisa Makino Guest Editors' Foreword. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Raffaele Mosca Finding Dominating Induced Matchings in P8 -Free Graphs in Polynomial Time. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Lélia Blin, Janna Burman, Nicolas Nisse Exclusive Graph Searching. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Konstantinos Panagiotou, Leo Speidel Asynchronous Rumor Spreading on Random Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ari Freund 0001 Improved Subquadratic 3SUM. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Guy Feigenblat, Ely Porat, Ariel Shiftan A Grouping Approach for Succinct Dynamic Dictionary Matching. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Frank Neumann 0001, Andrew M. Sutton Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yusuke Kobayashi 0001, Sho Toyooka Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Stephen Desalvo Exact Sampling Algorithms for Latin Squares and Sudoku Matrices via Probabilistic Divide-and-Conquer. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, S. Venkatesh 0001, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides Connectivity Graphs of Uncertainty Regions. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Juan A. Garay, Rafail Ostrovsky Special Issue: Algorithmic Tools in Cryptography. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Susanne Albers, Matthias Hellwig Online Makespan Minimization with Parallel Schedules. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman 0001, Timothy M. Chan On the Succinct Representation of Equivalence Classes. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael A. Bekos, Sabine Cornelsen, Luca Grilli 0001, Seok-Hee Hong 0001, Michael Kaufmann 0001 On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Surender Baswana, Shahbaz Khan 0004 Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Katharina T. Huber, Leo van Iersel, Vincent Moulton, Céline Scornavacca, Taoyang Wu Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth On Virtual Grey Box Obfuscation for General Circuits. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Konstantinos Panagiotou Efficient Sampling Methods for Discrete Distributions. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Holger Dell, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Tobias Mömke Complexity and Approximability of Parameterized MAX-CSPs. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Thore Husfeldt, Iyad A. Kanj Guest Editorial: Special Issue on Parameterized and Exact Computation. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benjamin Hescott, Caleb Malchik, Andrew Winslow Tight Bounds for Active Self-Assembly Using an Insertion Primitive. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Chia-Chen Wei, Sun-Yuan Hsieh Random and Conditional (t, k)-Diagnosis of Hypercubes. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pasin Manurangsi, Dana Moshkovitz Improved Approximation Algorithms for Projection Games. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Philip Bille, Patrick Hagge Cording, Inge Li Gørtz Compressed Subsequence Matching and Packed Tree Coloring. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis Computing Approximate Nash Equilibria in Polymatrix Games. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Danny Z. Chen, Haitao Wang 0001 Computing the Visibility Polygon of an Island in a Polygonal Domain. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dogan Corus, Jun He 0004, Thomas Jansen 0001, Pietro S. Oliveto, Dirk Sudholt, Christine Zarges On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Piotr Micek, Veit Wiechert An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andrei Lissovoi, Carsten Witt A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Christian Gießen, Carsten Witt The Interplay of Population Size and Mutation Probability in the (1+λ) EA on OneMax. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sariel Har-Peled, Subhro Roy Approximating the Maximum Overlap of Polygons under Translation. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Noga Alon, Moran Feldman, Moshe Tennenholtz Revenue and Reserve Prices in a Probabilistic Single Item Auction. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1N. R. Aravind, R. B. Sandeep, Naveen Sivadasan On Polynomial Kernelization of H-free Edge Deletion. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Lasse Kliemann The Price of Anarchy in Bilateral Network Formation in an Adversary Model. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jelena Marasevic, Clifford Stein 0001, Gil Zussman Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Quick but Odd Growth of Cacti. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rudolf Scheifele Steiner Trees with Bounded RC-Delay. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket On the Approximability of Digraph Ordering. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri 0001 Resilient Dynamic Programming. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Carlo Comin, Romeo Rizzi Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Qin Huang, Xingwu Liu, Xiaoming Sun 0001, Jialin Zhang 0001 Partial Sorting Problem on Evolving Data. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1François Le Gall, Shogo Nakajima Quantum Algorithm for Triangle Finding in Sparse Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
Displaying result #901 - #1000 of 3466 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][>>]
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