| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Yasuaki Kobayashi, Yota Otachi |
Parameterized Complexity of Graph Burning.  |
Algorithmica  |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Klemz, Günter Rote |
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane |
Approximating Dynamic Weighted Vertex Cover with Soft Capacities. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Ducoffe |
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyle Fox, Xinyi Li |
Approximating the Geometric Edit Distance. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Merkurev, Arseny M. Shur |
Computing The Maximum Exponent in a Stream. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing |
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Hirai 0001, Yuni Iwamasa |
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Édouard Bonnet, Eun Jung Kim 0002, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant |
Twin-width and Polynomial Kernels. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Thom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek |
Agglomerative Clustering of Growing Squares. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dawei Huang, Seth Pettie |
Approximate Generalized Matching: f-Matchings and f-Edge Covers. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Computing Minimal Unique Substrings for a Sliding Window. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Leo van Iersel, Remie Janssen, Mark Jones 0001, Yukihiro Murakami, Norbert Zeh |
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Louisa Seelbach Benkner, Stephan G. Wagner |
Distinct Fringe Subtrees in Random Trees. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Eunpyeong Hung, Mong-Jen Kao |
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski |
Efficient Computation of Sequence Mappability. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo |
Component Order Connectivity in Directed Graphs. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Clara Shikhelman |
Additive Approximation of Generalized Turán Questions. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau |
Dynamic Kernels for Hitting Sets and Set Packing. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Shiv Kumar Gupta 0001, Ayush Tulsyan |
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Fotakis 0001, Alkis Kalavasis, Christos Tzamos |
Efficient Parameter Estimation of Truncated Boolean Product Distributions. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná 0001, Aneta Pokorná |
On 3-Coloring of (2P4, C5)-Free Graphs. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Antipov, Maxim Buzdalov 0001, Benjamin Doerr |
Fast Mutation in Crossover-Based Algorithms. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol |
Multidimensional Period Recovery. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuya Shimizu, Ryuhei Mori |
Exponential-Time Quantum Algorithms for Graph Coloring Problems. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Shiv Kumar Gupta 0001, Till Knollmann |
Mincut Sensitivity Data Structures for the Insertion of an Edge. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | José Arturo Gil, Simone Santini |
Matching Regular Expressions on uncertain data. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Marinus Gottschau, Marilena Leichter |
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen 0001, R. Subashini |
On Subgraph Complementation to H-free Graphs. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Rizzo 0001, Alexandru I. Tomescu, Alberto Policriti |
Solving String Problems on Graphs Using the Labeled Direct Product. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa |
Posimodular Function Optimization. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinwoo An, Eunjin Oh 0001 |
Reachability Problems for Transmission Graphs. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor P. Fekete, Eike Niehs, Christian Scheffer, Arne Schmidt 0001 |
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Köppl, Simon J. Puglisi, Rajeev Raman |
Fast and Simple Compact Hashing via Bucketing. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Guozhen Rong, Yixin Cao 0001, Jian-xin Wang 0001, Zhifeng Wang |
Graph Searches and Their End Vertices. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron |
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr |
Does Comma Selection Help to Cope with Local Optima? |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tuukka Korhonen |
Finding Optimal Triangulations Parameterized by Edge Clique Cover. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari |
Bounded-Angle Minimum Spanning Trees. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Lengler, Frank Neumann 0001 |
Editorial. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph (Seffi) Naor, Seeun William Umboh, David P. Williamson |
Tight Bounds for Online Weighted Tree Augmentation. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh 0001, Roohani Sharma |
Parameterized Complexity of Directed Spanner Problems. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian |
Preclustering Algorithms for Imprecise Points. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amirhossein Rajabi, Carsten Witt |
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani |
Universal Slope Sets for Upward Planar Drawings. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Paniz Abedin, Sahar Hooshmand, Arnab Ganguly 0002, Sharma V. Thankachan |
The Heaviest Induced Ancestors Problem: Better Data Structures and Applications. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay |
Fast Exact Algorithms Using Hadamard Product of Polynomials. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Csaba D. Tóth |
Online Unit Clustering and Unit Covering in Higher Dimensions. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Julian Dörfler, Marc Roth, Johannes Schmitt 0002, Philip Wellnitz |
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Gill Barequet, Mira Shalah |
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaohua Li 0005, Marcin Pilipczuk |
Hardness of Metric Dimension in Graphs of Constant Treewidth. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakob Keller, Christian Rieck, Christian Scheffer, Arne Schmidt 0001 |
Particle-Based Assembly Using Precise Global Control. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Moran Feldman |
Correction to: Guess Free Maximization of Submodular and Linear Sums. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Arroyuelo, Rajeev Raman |
Adaptive Succinctness. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour |
Dynamic Averaging Load Balancing on Cycles. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenjun Li 0001, Chao Xu 0010, Yongjie Yang 0001, Jianer Chen, Jianxin Wang 0001 |
A Refined Branching Algorithm for the Maximum Satisfiability Problem. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen |
Local Routing in Sparse and Lightweight Geometric Graphs. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jungho Ahn, Eun Jung Kim 0002, Euiwoong Lee |
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Daryl Funk, Dillon Mayhew, Mike Newman |
Tree Automata and Pigeonhole Classes of Matroids: I. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yusuke Kobayashi 0001, Yoshio Okamoto, Yota Otachi, Yushi Uno |
Linear-Time Recognition of Double-Threshold Graphs. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz |
Faster Minimization of Tardy Processing Time on a Single Machine. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno |
Enumeration of Maximal Common Subsequences Between Two Strings. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mirmahdi Rahgoshay, Mohammad R. Salavatipour |
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse |
The Largest Connected Subgraph Game. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Tatiana Starikovskaya |
Streaming Dictionary Matching with Mismatches. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti |
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Saket Saurabh 0001, Prafullkumar Tale |
On the Parameterized Complexity of Maximum Degree Contraction Problem. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Massimo Cairo, Shahbaz Khan 0004, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu |
Safety in s-t Paths, Trails and Walks. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo Garlet Milani |
A Polynomial Kernel for Funnel Arc Deletion Set. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuya Haraguchi, Hiroshi Nagamochi |
Enumeration of Support-Closed Subsets in Confluent Systems. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Devismes, David Ilcinkas, Colette Johnen |
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Khaled M. Elbassioni |
Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Nederlof, Céline M. F. Swennenhuis |
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaqiao Li, Vishnu V. Narayan, Denis Pankratov |
Online Coloring and a New Type of Adversary for Online Graph Problems. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Siu-Wing Cheng, Yuchen Mao |
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Chenglin Fan, Benjamin Raichel, Gregory Van Buskirk |
Metric Violation Distance: Hardness and Approximation. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná 0001, Karolina Okrasa |
Vertex Deletion into Bipartite Permutation Graphs. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi 0001, Leen Stougie |
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Heuberger, Daniel Krenn, Gabriel F. Lipnik |
Asymptotic Analysis of q-Recursive Sequences. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Venkatesan Guruswami |
CNF Satisfiability in a Subspace and Related Problems. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Jaffke, Paloma T. Lima, Geevarghese Philip |
Structural Parameterizations of Clique Coloring. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Ducoffe |
Optimal Centrality Computations Within Bounded Clique-Width Graphs. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tzvi Alon, Nir Halman |
Strongly Polynomial FPTASes for Monotone Dynamic Programs. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mai Alzamel, Costas S. Iliopoulos, Dimitrios Letsios, Nicola Prezza |
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW). |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lavinia Egidi, Felipe A. Louza, Giovanni Manzini |
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Akanksha Agrawal 0001, Madhumita Kundu, Abhishek Sahu, Saket Saurabh 0001, Prafullkumar Tale |
Parameterized Complexity of Maximum Edge Colorable Subgraph. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Niklas Troost, Tilo Wiedera |
Approximating Multistage Matching Problems. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Bart de Keijzer, Dominik Wojtczak |
Facility Reallocation on the Line. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado |
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov |
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim Buzdalov 0001, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov |
Fixed-Target Runtime Analysis. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke |
Randomized Online Computation with High Probability Guarantees. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien Bensmail, Foivos Fioravantes, Nicolas Nisse |
On Proper Labellings of Graphs with Minimum Label Sum. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mario Ullrich, Jan Vybíral |
Deterministic Constructions of High-Dimensional Sets with Small Dispersion. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Krauthgamer, David Reitblat |
Almost-Smooth Histograms and Sliding-Window Graph Algorithms. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li 0001, Daniel Vaz 0001, Jiayi Xian |
On Approximating Degree-Bounded Network Design Problems. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Florin Manea, Radoslaw Serafin |
Fast and Longest Rollercoasters. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sander Borst, Leo van Iersel, Mark Jones 0001, Steven Kelk |
New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Haozhe An, Mohit Gurumukhani, Russell Impagliazzo, Michael Jaber, Marvin Künnemann, Maria Paula Parga Nina |
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yixin Cao 0001, Marcin Pilipczuk |
Preface to the Special Issue on Parameterized and Exact Computation. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license