|
|
Venues (Conferences, Journals, ...)
|
|
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 |
1 | Yixin Cao 0001, Ashutosh Rai 0001, R. B. Sandeep, Junjie Ye |
A Polynomial Kernel for Diamond-Free Editing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(1), pp. 197-215, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Julien Baste, Dimitrios M. Thilikos |
Contraction Bidimensionality of Geometric Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(2), pp. 510-531, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Gibney, Sharma V. Thankachan |
On the Complexity of Recognizing Wheeler Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(3), pp. 784-814, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk 0001 |
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(11), pp. 3407-3458, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle |
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(5), pp. 1385-1417, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Pietro S. Oliveto, Dirk Sudholt, Carsten Witt |
Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(6), pp. 1603-1658, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Yoshifumi Sakai, Shunsuke Inenaga |
A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(9), pp. 2581-2596, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis |
An Axiomatic Approach to Time-Dependent Shortest Path Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(3), pp. 815-870, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew |
Conflict-Free Coloring Bounds on Open Neighborhoods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(8), pp. 2154-2185, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz |
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(2), pp. 482-509, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ziyun Huang, Qilong Feng, Jianxin Wang 0001, Jinhui Xu 0001 |
Small Candidate Set for Translational Pattern Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(10), pp. 3034-3053, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Bruno Pasqualotto Cavalar, Mrinal Kumar 0001, Benjamin Rossman |
Monotone Circuit Lower Bounds from Robust Sunflowers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(12), pp. 3655-3685, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Denis Antipov, Benjamin Doerr, Vitalii Karavaev |
A Rigorous Runtime Analysis of the (1 + (λ , λ )) GA on Jump Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(6), pp. 1573-1602, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros |
Dynamic Data Structures for Timed Automata Acceptance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(11), pp. 3223-3245, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jon M. Kleinberg, Sigal Oren |
Mechanisms for (Mis)allocating Scientific Credit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(2), pp. 344-378, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Avivit Levy, B. Riva Shalom |
A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(3), pp. 590-638, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh 0001, Shaily Verma |
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(11), pp. 3246-3275, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Akanksha Agrawal 0001, Sudeshna Kolay, Meirav Zehavi |
Parameter Analysis for Guarding Terrains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(4), pp. 961-981, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Asaf Levin |
Approximation Schemes for the Generalized Extensible Bin Packing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(2), pp. 325-343, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Michael Lampis, Hirotaka Ono 0001, Yota Otachi |
Parameterized Complexity of (A, ℓ )-Path Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(4), pp. 871-895, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ashwin Jacob, Fahad Panolan, Venkatesh Raman 0001, Vibha Sahlot |
Structural Parameterizations with Modulator Oblivion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(8), pp. 2335-2357, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sayan Bandyapadhyay |
On Perturbation Resilience of Non-uniform k-Center. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(1), pp. 13-36, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen |
Relaxing the Irrevocability Requirement for Online Graph Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(7), pp. 1916-1951, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | |
Editor's Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(12), pp. 3521, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Zeev Nutov |
Approximating k-Connected m-Dominating Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(6), pp. 1511-1525, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ioannis Caragiannis, Panagiotis Kanellopoulos, Alexandros A. Voudouris |
Bounding the Inefficiency of Compromise in Opinion Formation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(1), pp. 234-271, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Júlio Araújo 0001, Marin Bougeret, Victor A. Campos, Ignasi Sau |
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(11), pp. 3365-3406, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Pratibha Choudhary |
Polynomial Time Algorithms for Tracking Path Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(6), pp. 1548-1570, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Karthekeyan Chandrasekaran, Weihang Wang 0002 |
ℓ p-Norm Multiway Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(9), pp. 2667-2701, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Naifeng Liu |
Algorithms for the Unit-Cost Stochastic Score Classification Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(10), pp. 3054-3074, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan 0001 |
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(4), pp. 1132-1162, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Guido Brückner, Nadine Davina Krisam, Tamara Mchedlidze |
Level-Planar Drawings with Few Slopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(1), pp. 176-196, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Leszek Gasieniec, Ralf Klasing, Tomasz Radzik |
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(10), pp. 3103-3106, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Aleksander Kedzierski, Jakub Radoszewski |
k-Approximate Quasiperiodicity Under Hamming and Edit Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(3), pp. 566-589, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Frank Kammer, Johannes Meintrup, Andrej Sajenko |
Space-Efficient Vertex Separators for Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(9), pp. 2414-2461, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jan Kratochvíl, Tomás Masarík, Jana Novotná 0001 |
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(12), pp. 3649-3680, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Rémy Belmonte, Ignasi Sau |
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(8), pp. 2351-2373, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Harry Buhrman, Matthias Christandl, Michal Koucký 0001, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin |
High Entropy Random Selection Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(2), pp. 667-694, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Édouard Bonnet, Nidhi Purohit |
Metric Dimension Parameterized By Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(8), pp. 2606-2633, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller, Dorine Tabary |
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(7), pp. 2063-2095, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Anne Auger, Per Kristian Lehre |
Preface to the Special Issue on Theory of Genetic and Evolutionary Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(4), pp. 903-905, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber |
Flip Distances Between Graph Orientations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(1), pp. 116-143, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Gregory Rosenthal |
Beating Treewidth for Average-Case Subgraph Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(8), pp. 2521-2551, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Sebastian Schraink |
Tight Bounds for Online Coloring of Basic Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(1), pp. 337-360, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Stefano Leonardi 0001, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang |
Budget Feasible Mechanisms on Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(5), pp. 1222-1237, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti |
Succinct Encodings for Families of Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(3), pp. 776-794, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, Sampson Wong |
Translation Invariant Fréchet Distance Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(11), pp. 3514-3533, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Amos Beimel, Kobbi Nissim, Uri Stemmer |
Learning Privately with Labeled and Unlabeled Examples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(1), pp. 177-215, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Leah Epstein, Elena Kleiman |
Selfish Vector Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(9), pp. 2952-2988, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ágnes Cseh, Telikepalli Kavitha |
Popular Matchings in Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(5), pp. 1493-1523, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk, Blair D. Sullivan |
Polynomial Treedepth Bounds in Linear Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(1), pp. 361-386, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller |
Online Multistage Subset Maximization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(8), pp. 2374-2399, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Robert Ganian, Sebastian Ordyniak |
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(2), pp. 726-752, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Matthias Englert, David Mezlaf, Matthias Westermann |
Online Makespan Scheduling with Job Migration on Uniform Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(12), pp. 3537-3566, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti |
Encoding Two-Dimensional Range Top-k Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(11), pp. 3379-3402, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Frank Neumann 0001, Mojgan Pourhassan, Carsten Witt |
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(10), pp. 3209-3237, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita |
Optimal Matroid Partitioning Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(6), pp. 1653-1676, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Florian Hörsch, Zoltán Szigeti |
The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(8), pp. 2333-2350, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi |
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(6), pp. 1861-1884, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Florent Foucaud, Benjamin Gras 0002, Anthony Perez 0001, Florian Sikora |
On the Complexity of Broadcast Domination and Multipacking in Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(9), pp. 2651-2677, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Yiannis Giannakopoulos, Alexander Hammerl, Diogo Poças |
A New Lower Bound for Deterministic Truthful Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(9), pp. 2895-2913, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane |
Approximating the Canadian Traveller Problem with Online Randomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(5), pp. 1524-1543, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Arindam Khan 0001, Leon Ladewig |
Best Fit Bin Packing with Random Order Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(9), pp. 2833-2858, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | |
Editor's Note: Special Issue on Genetic and Evolutionary Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(10), pp. 3015-3016, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour |
Special Issue on Algorithms and Data Structures (WADS 2019). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(3), pp. 775, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Arindam Khan 0001, Leon Ladewig |
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(6), pp. 1750-1785, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Andrew M. Sutton |
Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(4), pp. 1138-1163, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre 0001, Ivan Rapaport, Éric Rémila, Ioan Todinca |
Compact Distributed Certification of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(7), pp. 2215-2244, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | José Fuentes-Sepúlveda, Diego Seco, Raquel Viaña |
Succinct Encoding of Binary Strings Representing Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(11), pp. 3432-3468, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Bart M. P. Jansen, Jan Arne Telle |
Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(8), pp. 2469-2470, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jana Novotná 0001, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak |
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(8), pp. 2634-2650, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Douglas Soares Gonçalves, Carlile Lavor, Leo Liberti, Michael Souza 0001 |
A New Algorithm for the KDMDGP Subclass of Distance Geometry Problems with Exact Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(8), pp. 2400-2426, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Pat Morin |
A Fast Algorithm for the Product Structure of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(5), pp. 1544-1558, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Diodato Ferraioli, Carmine Ventre |
Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(2), pp. 695-725, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson 0002, Daniël Paulusma, Théo Pierron |
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(3), pp. 822-852, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ghurumuruhan Ganesan |
Constrained Minimum Passage Time in Random Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(2), pp. 576-588, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán |
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(5), pp. 1316-1351, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta 0002 |
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(8), pp. 2471-2502, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro 0001, Yakov Nekrich |
Range Majorities and Minorities in Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(6), pp. 1707-1733, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Dror Rawitz, Adi Rosén |
Online Budgeted Maximum Coverage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(9), pp. 2989-3014, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche |
Finding Temporal Paths Under Waiting Time Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(9), pp. 2754-2802, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Santanu Bhowmick, Tanmay Inamdar 0002, Kasturi R. Varadarajan |
Fault-Tolerant Covering Problems in Metric Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(2), pp. 413-446, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad |
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(9), pp. 2914-2951, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Zeev Nutov |
On the Tree Augmentation Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(2), pp. 553-575, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Steven Chaplick, Martin Töpfer 0002, Jan Voborník, Peter Zeman 0001 |
On H-Topological Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(11), pp. 3281-3318, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Doerr, Carsten Witt, Jing Yang 0016 |
Runtime Analysis for Self-adaptive Mutation Rates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(4), pp. 1012-1053, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu |
The Maximum Binary Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(8), pp. 2427-2468, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Marios Mavronicolas, Loizos Michael, Vicky Papadopoulou Lesta, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis |
The Price of Defense. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(5), pp. 1256-1315, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Chi-Yeh Chen, Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng |
Matching Cut in Graphs with Large Minimum Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(5), pp. 1238-1255, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin |
A New Lower Bound for Classic Online Bin Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(7), pp. 2047-2062, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Mong-Jen Kao |
Iterative Partial Rounding for Vertex Cover with Hard Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(1), pp. 45-71, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Marc Bury, Michele Gentili, Chris Schwiegelshohn, Mara Sorella |
Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(5), pp. 1371-1392, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Doerr, Carola Doerr, Johannes Lengler |
Self-Adjusting Mutation Rates with Provably Optimal Success Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(10), pp. 3108-3147, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Gill Barequet, Minati De, Michael T. Goodrich |
Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(7), pp. 2245-2272, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Maria Chudnovsky, Shenwei Huang, Sophie Spirkl, Mingxian Zhong |
List 3-Coloring Graphs with No Induced P6+rP3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(1), pp. 216-251, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sariel Har-Peled, Mitchell Jones, Saladi Rahul |
Active-Learning a Convex Body in Low Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(6), pp. 1885-1917, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Per Kristian Lehre, Phan Trung Hai Nguyen |
Runtime Analyses of the Population-Based Univariate Estimation of Distribution Algorithms on LeadingOnes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(10), pp. 3238-3280, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Aram Berendsohn, László Kozma 0002, Dániel Marx |
Finding and Counting Permutations via CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(8), pp. 2552-2577, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Doerr, Timo Kötzing |
Multiplicative Up-Drift. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(10), pp. 3017-3058, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Guilherme de C. M. Gomes, Ignasi Sau |
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(6), pp. 1677-1706, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
Displaying result #301 - #400 of 3466 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|