| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Feng Shi 0003, Frank Neumann 0001, Jianxin Wang 0001 |
Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem.  |
Algorithmica  |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Vittorio Bilò, Marios Mavronicolas |
The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza |
Computing the Largest Bond and the Maximum Connected Cut of a Graph. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuya Masumura, Taihei Oki, Yutaro Yamaguchi 0001 |
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jongmin Choi, Sergio Cabello, Hee-Kap Ahn |
Maximizing Dominance in the Plane and its Applications. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Bressan 0002 |
Faster algorithms for counting subgraphs in sparse graphs. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach |
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber |
Correction to: Outer 1-Planar Graphs. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Chao Qian 0001, Chao Bian 0002, Yang Yu 0001, Ke Tang 0001, Xin Yao 0001 |
Analysis of Noisy Evolutionary Optimization When Sampling Fails. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed 0001, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
Internal Dictionary Matching. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith |
Online Node- and Edge-Deletion Problems with Advice. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Akira Matsubayashi |
Non-Greedy Online Steiner Trees on Outerplanar Graphs. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Shu Zhang 0005, Daming Zhu, Haitao Jiang, Jiong Guo, Haodi Feng, Xiaowen Liu |
Sorting a Permutation by Best Short Swaps. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr |
The Runtime of the Compact Genetic Algorithm on Jump Functions. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson 0001, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung |
Computing the Rooted Triplet Distance Between Phylogenetic Networks. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor P. Fekete, Robert Gmyr, Sabrina Hugo, Phillip Keldenich, Christian Scheffer, Arne Schmidt 0001 |
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese Biedl, Saeed Mehrabi 0001 |
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Lengler, Dirk Sudholt, Carsten Witt |
The Complex Parameter Landscape of the Compact Genetic Algorithm. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Ofer Neiman |
Near Isometric Terminal Embeddings for Doubling Metrics. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann |
Top Tree Compression of Tries. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Eun Jung Kim 0002, O-joung Kwon |
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jie Zhang 0008 |
Average-Case Approximation Ratio of Scheduling without Payments. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Moran Feldman |
Guess Free Maximization of Submodular and Linear Sums. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc |
Building a Nest by an Automaton. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathew C. Francis, Rian Neogi, Venkatesh Raman 0001 |
Recognizing k-Clique Extendible Orderings. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Angel A. Cantu, Austin Luchsinger, Robert T. Schweller, Tim Wylie |
Covert Computation in Self-Assembled Circuits. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Dirk Sudholt |
Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yong Chen 0002, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang 0001 |
Approximation Algorithms for Maximally Balanced Connected Graph Partition. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Céline Chevalier, Fabien Laguillaumie, Damien Vergnaud |
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | José A. Soto, Claudio Telha |
Independent Sets and Hitting Sets of Bicolored Rectangular Families. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann |
Travelling on Graphs with Small Highway Dimension. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Athanasios L. Konstantinidis, Charis Papadopoulos |
Cluster Deletion on Interval Graphs and Split Related Graphs. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Arindam Biswas 0001, Venkatesh Raman 0001, Saket Saurabh 0001 |
Approximation in (Poly-) Logarithmic Space. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoichi Iwata, Yusuke Kobayashi 0001 |
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan |
Network Design under General Wireless Interference. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Arnaud Labourel, Sébastien Ratel |
Distance and Routing Labeling Schemes for Cube-Free Median Graphs. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Hasunuma |
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Iqra Altaf Gillani, Amitabha Bagchi |
A Queueing Network-Based Distributed Laplacian Solver. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi 0001, Michiel Smid |
On the Minimum Consistent Subset Problem. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Ali Abam, Mohammad Sadegh Borouny |
Local Geometric Spanners. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Antipov, Benjamin Doerr |
A Tight Runtime Analysis for the (μ + λ ) EA. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger |
Dispersing Obnoxious Facilities on a Graph. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen |
Online Bin Covering with Advice. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Junjie Luo 0001, Hendrik Molter, André Nichterlein, Rolf Niedermeier |
Parameterized Dynamic Cluster Editing. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanne Albers, Maximilian Janke |
Scheduling in the Random-Order Model. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Marin Bougeret, R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Jocelyn Thiebaut, Meirav Zehavi |
Packing Arc-Disjoint Cycles in Tournaments. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Britta Dorn, Ronald de Haan, Ildikó Schlotter |
Obtaining a Proportional Allocation by Deleting Items. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes |
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Roth |
Parameterized Counting of Partially Injective Homomorphisms. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan 0001 |
Towards a Polynomial Kernel for Directed Feedback Vertex Set. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto |
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Fabian Klute, Sebastian Ordyniak |
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán |
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakob Bossek, Frank Neumann 0001, Pan Peng 0001, Dirk Sudholt |
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan 0001 |
On Structural Parameterizations of the Edge Disjoint Paths Problem. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis |
Connected Subgraph Defense Games. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Akanksha Agrawal 0001, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi |
Simultaneous Feedback Edge Set: A Parameterized Perspective. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kook Jin Ahn, Graham Cormode, Sudipto Guha, Andrew McGregor 0001, Anthony Wirth |
Correlation Clustering in Data Streams. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Evaristo Caraballo, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura |
Maximum Box Problem on Stochastic Points. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés |
The Inverse Voronoi Problem in Graphs II: Trees. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Myriam Preissmann, Cléophée Robin, Nicolas Trotignon |
On the Complexity of Colouring Antiprismatic Graphs. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold T. Saunders |
A Class of Random Recursive Tree Algorithms with Deletion. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Chien-Chung Huang, Naonori Kakimura |
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Sutton, Carsten Witt |
Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs. |
Algorithmica |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski |
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Edvin Berglin, Gerth Stølting Brodal |
A Simple Greedy Algorithm for Dynamic Graph Orientation. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sushmita Gupta, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi |
Quadratic Vertex Kernel for Rainbow Matching. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhao An, Qilong Feng, Iyad Kanj, Ge Xia |
The Complexity of Tree Partitioning. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubie Chen, Bart M. P. Jansen, Astrid Pieterse |
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Huang-Ting Chan, Hsuan-Tsung Chiu, Chang-Biau Yang, Yung-Hsing Peng |
The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Emil Feldmann, Dániel Marx |
The Parameterized Hardness of the k-Center Problem in Transportation Networks. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid 0001 |
Walking Through Waypoints. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Kitty Meeks, Fiona Skerman |
The Parameterised Complexity of Computing the Maximum Modularity of a Graph. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Markus L. Schmid |
Consensus Strings with Small Maximum Distance and Small Distance Sum. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyu Xiao 0001, Hiroshi Nagamochi |
Characterizing Star-PCGs. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann 0001, Sergey Pupyrev |
Queue Layouts of Planar 3-Trees. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Akira Matsubayashi |
A $3+\varOmega (1)$ Lower Bound for Page Migration. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma |
Connected Vertex Cover for (sP1+P5)-Free Graphs. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yijie Han |
Sorting Real Numbers in $O\big (n\sqrt{\log n}\big )$ Time and Linear Space. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu 0001 |
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes |
Study of a Combinatorial Game in Graphs Through Linear Programming. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Reut Levi, Dana Ron, Ronitt Rubinfeld |
Local Algorithms for Sparse Spanning Graphs. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yijie Han |
Correction to: Sorting Real Numbers in $O(n\sqrt{\log n})$ Time and Linear Space. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziyun Huang, Jinhui Xu 0001 |
An Efficient Sum Query Algorithm for Distance-Based Locally Dominating Functions. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg |
Placing Labels in Road Maps: Algorithms and Complexity. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin |
Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimbinaina Ralaivaosaona, Matas Sileikis, Stephan G. Wagner |
A Central Limit Theorem for Almost Local Additive Tree Functionals. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Roth, Johannes Schmitt 0002 |
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos |
Subgraph Complementation. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Spyros Angelopoulos 0001, Marc P. Renault, Pascal Schweitzer |
Stochastic Dominance and the Bijective Ratio of Online Algorithms. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci 0001, Guido Proietti |
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Argyrios Deligkas, John Fearnley, Paul G. Spirakis |
Lipschitz Continuity and Approximate Equilibria. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit |
Deterministic Treasure Hunt in the Plane with Angular Hints. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Special Issue on Computing and Combinatorics. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora |
Parameterized Orientable Deletion. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Henzinger, Dariusz Leniowski, Claire Mathieu |
Dynamic Clustering to Minimize the Sum of Radii. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel |
Crossing Number for Graphs with Bounded Pathwidth. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian Li 0012, Xiaoming Sun 0001, Jialin Zhang 0001 |
On the Optimality of Tape Merge of Two Lists with Similar Size. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | James Allen Fill, Mark Daniel Ward |
Special Issue on Analysis of Algorithms. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner |
An Adversarial Model for Scheduling with Testing. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license