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
1Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná 0001, Daniël Paulusma, Veronika Slívová Colouring (Pr + Ps)-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant Parameterized Complexity of Independent Set in H-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Vicente Acuña, Roberto Grossi, Giuseppe Francesco Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri On Bubble Generators in Directed Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Charles Maske, Jaime Cohen, Elias P. Duarte Jr. Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley Non-clairvoyantly Scheduling to Minimize Convex Functions. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zengfeng Huang, Ke Yi 0001, Qin Zhang 0001 Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot Dynamic Graph Coloring. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak Counting Linear Extensions: Parameterizations by Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon When Can Graph Hyperbolicity be Computed in Linear Time? Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomonari Kitahara, Noriyoshi Sukegawa A Simple Projection Algorithm for Linear Programming Problems. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shay Golan 0001, Tsvi Kopelowitz, Ely Porat Streaming Pattern Matching with d Wildcards. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin Sparse Selfreducible Sets and Nonuniform Lower Bounds. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Timothy M. Chan, John Hershberger 0001, Simon Pratt Two Approaches to Building Time-Windowed Geometric Data Structures. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomas Gavenciak, Barbara Geissmann, Johannes Lengler Sorting by Swaps with Noisy Comparisons. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Carola Doerr, Timo Kötzing Solving Problems with Unknown Solution Length at Almost No Extra Cost. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Viresh Patel, Guus Regts Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Antonios Antoniadis 0001, Chien-Chung Huang, Sebastian Ott A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Klaus Jansen, Marten Maack An EPTAS for Scheduling on Unrelated Machines of Few Different Types. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom Mind the Gap! - Online Dictionary Matching with One Gap. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi Improved Parameterized Algorithms for Network Query Problems. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Florian Brandl, Telikepalli Kavitha Two Problems in Max-Size Popular Matchings. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Preface: Special Issue on WADS 2017. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arne Meier, Sebastian Ordyniak, M. S. Ramanujan 0001, Irena Schindler Backdoors for Linear Temporal Logic. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya Longest Common Substring with Approximately k Mismatches. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ágnes Cseh, Jannik Matuschke New and Simple Algorithms for Stable Flow Problems. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Timothy M. Chan, Dimitrios Skrepetos Faster Approximate Diameter and Distance Oracles in Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Oguz Kaya, Yves Robert Computing Dense Tensor Decompositions with Optimal Dimension Trees. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani Distributed Methods for Computing Approximate Equilibria. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yixin Cao 0001, Jianer Chen Preface to the Special Issue on Computing and Combinatorics. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele Turbocharging Treewidth Heuristics. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Danny Segev Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States? Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lena Schlipf, Jens M. Schmidt Edge-Orders. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael A. Bekos, Henry Förster, Michael Kaufmann 0001 On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid Maximum Plane Trees in Multipartite Geometric Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marin Bougeret, Ignasi Sau How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich 0001, Timo Kötzing, Martin Schirneck Island Models Meet Rumor Spreading. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Elisabet Burjons, Dennis Komm, Marcel Schöngens The k-Server Problem with Advice in d Dimensions and on the Sphere. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Pawel Rzazewski Optimality Program in Segment and String Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rajesh Chitnis, Andreas Emil Feldmann, Ondrej Suchý A Tight Lower Bound for Planar Steiner Orientation. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Frank Kammer, Dieter Kratsch, Moritz Laudahn Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Haitao Wang 0001, Jingru Zhang Covering Uncertain Points in a Tree. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Austin Halper, Miguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong Station Assignment with Reallocation. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood Track Layouts, Layered Path Decompositions, and Leveled Planarity. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Koyo Hayashi, Satoru Iwata 0001 Correction to: Counting Minimum Weight Arborescences. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ishai Kones, Asaf Levin A Unified Framework for Designing EPTAS for Load Balancing on Parallel Machines. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Parameterized Algorithms for List K-Cycle. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michal Wlodarczyk 0001 Clifford Algebras Meet Tree Decompositions. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak Linear Search by a Pair of Distinct-Speed Robots. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Spyros Angelopoulos 0001, Giorgio Lucarelli, Kim Thang Nguyen Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kevin Buchin, Irina Kostitsyna, Maarten Löffler, Rodrigo I. Silveira Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles). Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hugo Gilbert, Olivier Spanjaard Optimizing a Generalized Gini Index in Stable Marriage Problems: NP-Hardness, Approximation and a Polynomial Time Special Case. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kitty Meeks Randomised Enumeration of Small Witnesses Using a Decision Oracle. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma Independent Feedback Vertex Set for P5-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Antonios Antoniadis 0001, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1David G. Harris 0001 Deterministic Parallel Algorithms for Bilinear Objective Functions. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Samir Khuller, Sheng Yang 0005 Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yann Disser, Stefan Kratsch, Manuel Sorge The Minimum Feasible Tileset Problem. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal 0001, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof New Tools and Connections for Exponential-Time Approximation. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mourad Baïou, Francisco Barahona An Algorithm to Compute the Nucleolus of Shortest Path Games. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Editor's Note: Special Issue on Parameterized and Exact Computation. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sebastian Brandt 0002, Roger Wattenhofer Approximating Small Balanced Vertex Separators in Almost Linear Time. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mathieu Liedloff, Pedro Montealegre 0001, Ioan Todinca Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Susanne Albers, Achim Passen New Online Algorithms for Story Scheduling in Web Advertising. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos Explicit Linear Kernels for Packing Problems. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren Optimization with Demand Oracles. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert T. Schweller, Andrew Winslow, Tim Wylie Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Patrizio Angelini, Giordano Da Lozzo Clustered Planarity with Pipes. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Carola Doerr, Dirk Sudholt Preface to the Special Issue on Theory of Genetic and Evolutionary Computation. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1David Bryant, Céline Scornavacca An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sumedh Tirodkar, Sundar Vishwanathan Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Julien Lesca, Michel Minoux, Patrice Perny The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Masoud Seddighin, Majid Farhadi, Mohammad Ghodsi, Reza Alijani, Ahmad S. Tajik Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You Information Complexity of the AND Function in the Two-Party and Multi-party Settings. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter Full Characterization of a Class of Graphs Tailored for Software Watermarking. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mourad Baïou, Francisco Barahona Faster Algorithms for Security Games on Matroids. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bart M. P. Jansen, Astrid Pieterse Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Philip Dasler, David M. Mount Modular Circulation and Applications to Traffic Management. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1T. Karthick, Frédéric Maffray, Lucas Pastor Polynomial Cases for the Vertex Coloring Problem. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sushmita Gupta, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi Parameterized Algorithms and Kernels for Rainbow Matching. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yoann Dieudonné, Andrzej Pelc Impact of Knowledge on Election Time in Anonymous Networks. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yakov Babichenko, Yuval Emek, Michal Feldman, Boaz Patt-Shamir, Ron Peretz, Rann Smorodinsky Stable Secretaries. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi Fixed Block Compression Boosting in FM-Indexes: Theory and Practice. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen Online Dominating Set. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Fahad Panolan, Ashutosh Rai 0001, Venkatesh Raman 0001, Saket Saurabh 0001 Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eunjin Oh 0001, Hee-Kap Ahn A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Xiaocheng Hu, Cheng Sheng 0001, Yufei Tao 0001 Building an Optimal Point-Location Structure in O( sort (n)) I/Os. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya Correction to: Longest Common Substring with Approximately k Mismatches. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zengfeng Huang, Pan Peng 0001 Dynamic Graph Stream Algorithms in o(n) Space. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pierre-Louis Giscard, Nils M. Kriege, Richard C. Wilson 0001 A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
Displaying result #601 - #700 of 3466 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][>>]
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