- Sarah Blind, Kolja Knauer, Petru Valicov:
Enumerating k-Arc-Connected Orientations. Algorithmica 82(12): 3588-3603 (2020) - Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden:
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica 82(12): 3566-3587 (2020) - Vincenzo Bonifaci:
On the Convergence Time of a Natural Dynamics for Linear Programming. Algorithmica 82(2): 300-315 (2020) - Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica 82(8): 2360-2394 (2020) - Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés:
The Inverse Voronoi Problem in Graphs I: Hardness. Algorithmica 82(10): 3018-3040 (2020) - Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Treasure Hunt in the Plane with Angular Hints. Algorithmica 82(11): 3250-3281 (2020) - Karl Bringmann, Thore Husfeldt, Måns Magnusson:
Multivariate Analysis of Orthogonal Range Searching and Graph Distances. Algorithmica 82(8): 2292-2315 (2020) - Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts. Algorithmica 82(1): 64-87 (2020) - Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Online Stochastic Matching: New Algorithms and Bounds. Algorithmica 82(10): 2737-2783 (2020) - Laurent Bulteau, Markus L. Schmid:
Consensus Strings with Small Maximum Distance and Small Distance Sum. Algorithmica 82(5): 1378-1409 (2020) - Jean Cardinal, Jerri Nummenpalo, Emo Welzl:
Solving and Sampling with Many Solutions. Algorithmica 82(5): 1474-1489 (2020) - Titouan Carette, Mathieu Laurière, Frédéric Magniez:
Extended Learning Graphs for Triangle Finding. Algorithmica 82(4): 980-1005 (2020) - Huang-Ting Chan, Hsuan-Tsung Chiu, Chang-Biau Yang, Yung-Hsing Peng:
The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems. Algorithmica 82(7): 2039-2062 (2020) - Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger:
Greed is Good for Deterministic Scale-Free Networks. Algorithmica 82(11): 3338-3389 (2020) - Hubie Chen, Bart M. P. Jansen, Astrid Pieterse:
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. Algorithmica 82(8): 2200-2242 (2020) - Siu-Wing Cheng, Kai Jin, Lie Yan:
Extensions of Self-Improving Sorters. Algorithmica 82(1): 88-106 (2020) - Robert Chiang, Kanstantsin Pashkovich:
On the Approximability of the Stable Matching Problem with Ties of Size Two. Algorithmica 82(9): 2668-2686 (2020) - Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson:
Online Clique Clustering. Algorithmica 82(4): 938-965 (2020) - Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Study of a Combinatorial Game in Graphs Through Linear Programming. Algorithmica 82(2): 212-244 (2020) - Stefano Coniglio, Nicola Gatti, Alberto Marchesi:
Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case. Algorithmica 82(5): 1189-1238 (2020) - Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. Algorithmica 82(6): 1547-1573 (2020) - Dogan Corus, Pietro S. Oliveto:
On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms. Algorithmica 82(12): 3676-3706 (2020) - Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica 82(10): 2841-2866 (2020) - Peter Damaschke:
Dividing Splittable Goods Evenly and With Limited Fragmentation. Algorithmica 82(5): 1298-1328 (2020) - Bhaskar DasGupta, Mano Vikash Janardhanan, Farzane Yahyanejad:
Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures). Algorithmica 82(7): 1741-1783 (2020) - Argyrios Deligkas, John Fearnley, Paul G. Spirakis:
Lipschitz Continuity and Approximate Equilibria. Algorithmica 82(10): 2927-2954 (2020) - Hu Ding, Jinhui Xu:
A Unified Framework for Clustering Constrained Data Without Locality Property. Algorithmica 82(4): 808-852 (2020) - Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho:
Weak Coverage of a Rectangular Barrier. Algorithmica 82(4): 721-746 (2020) - Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse:
On the Complexity of Computing Treebreadth. Algorithmica 82(6): 1574-1600 (2020) - Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
An Adversarial Model for Scheduling with Testing. Algorithmica 82(12): 3630-3675 (2020)