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