Bergé, Pierre; Busson, Anthony; Feghali, Carl; Watrigant, Rémi 1-extendability of independent sets. (English) Zbl 07823157 Algorithmica 86, No. 3, 757-781 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{P. Bergé} et al., Algorithmica 86, No. 3, 757--781 (2024; Zbl 07823157) Full Text: DOI
de Berg, Mark; Markovic, Aleksandar; Umboh, Seeun William The online broadcast range-assignment problem. (English) Zbl 07777577 Algorithmica 85, No. 12, 3928-3956 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{M. de Berg} et al., Algorithmica 85, No. 12, 3928--3956 (2023; Zbl 07777577) Full Text: DOI OA License
Banerjee, Sumanta; Chaudhary, Juhi; Pradhan, Dinabandhu Unique response Roman domination: complexity and algorithms. (English) Zbl 07777576 Algorithmica 85, No. 12, 3889-3927 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{S. Banerjee} et al., Algorithmica 85, No. 12, 3889--3927 (2023; Zbl 07777576) Full Text: DOI
Cordasco, Gennaro; Gargano, Luisa; Rescigno, Adele A. Immunization in the threshold model: a parameterized complexity study. (English) Zbl 07767694 Algorithmica 85, No. 11, 3376-3405 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{G. Cordasco} et al., Algorithmica 85, No. 11, 3376--3405 (2023; Zbl 07767694) Full Text: DOI OA License
Eto, Hiroshi; Ito, Takehiro; Miyano, Eiji; Suzuki, Akira; Tamura, Yuma Happy set problem on subclasses of co-comparability graphs. (English) Zbl 07767692 Algorithmica 85, No. 11, 3327-3347 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{H. Eto} et al., Algorithmica 85, No. 11, 3327--3347 (2023; Zbl 07767692) Full Text: DOI
Lucke, Felicia; Paulusma, Daniël; Ries, Bernard Finding matching cuts in \(H\)-free graphs. (English) Zbl 07746799 Algorithmica 85, No. 10, 3290-3322 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{F. Lucke} et al., Algorithmica 85, No. 10, 3290--3322 (2023; Zbl 07746799) Full Text: DOI arXiv OA License
Dieudonné, Yoann; Pelc, Andrzej; Petit, Franck Almost universal anonymous rendezvous in the plane. (English) Zbl 07746795 Algorithmica 85, No. 10, 3110-3143 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{Y. Dieudonné} et al., Algorithmica 85, No. 10, 3110--3143 (2023; Zbl 07746795) Full Text: DOI arXiv
Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Melnichenko, Anna Social distancing network creation. (English) Zbl 07704070 Algorithmica 85, No. 7, 2087-2130 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{T. Friedrich} et al., Algorithmica 85, No. 7, 2087--2130 (2023; Zbl 07704070) Full Text: DOI arXiv
Chen, Di; Golin, Mordecai Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows. (English) Zbl 07704066 Algorithmica 85, No. 7, 1948-2000 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{D. Chen} and \textit{M. Golin}, Algorithmica 85, No. 7, 1948--2000 (2023; Zbl 07704066) Full Text: DOI arXiv
Sawada, Joe; Williams, Aaron Constructing the first (and coolest) fixed-content universal cycle. (English) Zbl 07691821 Algorithmica 85, No. 6, 1754-1785 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{J. Sawada} and \textit{A. Williams}, Algorithmica 85, No. 6, 1754--1785 (2023; Zbl 07691821) Full Text: DOI
Eppstein, David A stronger lower bound on parametric minimum spanning trees. (English) Zbl 07691820 Algorithmica 85, No. 6, 1738-1753 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{D. Eppstein}, Algorithmica 85, No. 6, 1738--1753 (2023; Zbl 07691820) Full Text: DOI
Chiarelli, Nina; Krnc, Matjaž; Milanič, Martin; Pferschy, Ulrich; Pivač, Nevena; Schauer, Joachim Fair allocation of indivisible items with conflict graphs. (English) Zbl 07680781 Algorithmica 85, No. 5, 1459-1489 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{N. Chiarelli} et al., Algorithmica 85, No. 5, 1459--1489 (2023; Zbl 07680781) Full Text: DOI arXiv
Călinescu, Gruia; Wang, Xiaolang Combination algorithms for Steiner tree variants. (English) Zbl 07677080 Algorithmica 85, No. 1, 153-169 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{G. Călinescu} and \textit{X. Wang}, Algorithmica 85, No. 1, 153--169 (2023; Zbl 07677080) Full Text: DOI
Bhore, Sujoy; Carmi, Paz; Kolay, Sudeshna; Zehavi, Meirav Parameterized study of Steiner tree on unit disk graphs. (English) Zbl 07677079 Algorithmica 85, No. 1, 133-152 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{S. Bhore} et al., Algorithmica 85, No. 1, 133--152 (2023; Zbl 07677079) Full Text: DOI arXiv
Marino, Andrea; Silva, Ana Eulerian walks in temporal graphs. (English) Zbl 1506.68083 Algorithmica 85, No. 3, 805-830 (2023). MSC: 68R10 05C45 05C85 68Q27 PDFBibTeX XMLCite \textit{A. Marino} and \textit{A. Silva}, Algorithmica 85, No. 3, 805--830 (2023; Zbl 1506.68083) Full Text: DOI
Bumpus, Benjamin Merlin; Meeks, Kitty Edge exploration of temporal graphs. (English) Zbl 1508.68261 Algorithmica 85, No. 3, 688-716 (2023). MSC: 68R10 05C45 68Q27 PDFBibTeX XMLCite \textit{B. M. Bumpus} and \textit{K. Meeks}, Algorithmica 85, No. 3, 688--716 (2023; Zbl 1508.68261) Full Text: DOI
Bar-Noy, Amotz; Peleg, David; Perry, Mor; Rawitz, Dror Composed degree-distance realizations of graphs. (English) Zbl 1506.68064 Algorithmica 85, No. 3, 665-687 (2023). MSC: 68R10 05C85 68Q17 PDFBibTeX XMLCite \textit{A. Bar-Noy} et al., Algorithmica 85, No. 3, 665--687 (2023; Zbl 1506.68064) Full Text: DOI
Jahanjou, Hamidreza; Kantor, Erez; Rajaraman, Rajmohan Improved algorithms for scheduling unsplittable flows on paths. (English) Zbl 1506.68186 Algorithmica 85, No. 2, 563-583 (2023). MSC: 68W40 68W25 68W27 90B35 PDFBibTeX XMLCite \textit{H. Jahanjou} et al., Algorithmica 85, No. 2, 563--583 (2023; Zbl 1506.68186) Full Text: DOI
Tsakalidis, Konstantinos; Wild, Sebastian; Zamaraev, Viktor Succinct permutation graphs. (English) Zbl 1508.68082 Algorithmica 85, No. 2, 509-543 (2023). MSC: 68P05 05C85 68R10 68W05 PDFBibTeX XMLCite \textit{K. Tsakalidis} et al., Algorithmica 85, No. 2, 509--543 (2023; Zbl 1508.68082) Full Text: DOI arXiv
Ağaoğlu Çağırıcı, Deniz; Hliněný, Petr Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs. (English) Zbl 1508.68257 Algorithmica 85, No. 2, 352-383 (2023). MSC: 68R10 05C60 05C62 05C85 68Q27 PDFBibTeX XMLCite \textit{D. Ağaoğlu Çağırıcı} and \textit{P. Hliněný}, Algorithmica 85, No. 2, 352--383 (2023; Zbl 1508.68257) Full Text: DOI arXiv
Bentert, Matthias; Nichterlein, André Parameterized complexity of diameter. (English) Zbl 1527.68152 Algorithmica 85, No. 2, 325-351 (2023). Reviewer: Guillaume Fertin (Nantes) MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{M. Bentert} and \textit{A. Nichterlein}, Algorithmica 85, No. 2, 325--351 (2023; Zbl 1527.68152) Full Text: DOI
Elbassioni, Khaled Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations. (English) Zbl 07628948 Algorithmica 84, No. 12, 3622-3654 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{K. Elbassioni}, Algorithmica 84, No. 12, 3622--3654 (2022; Zbl 07628948) Full Text: DOI
Filtser, Arnold; Neiman, Ofer Light spanners for high dimensional norms via stochastic decompositions. (English) Zbl 07596609 Algorithmica 84, No. 10, 2987-3007 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{A. Filtser} and \textit{O. Neiman}, Algorithmica 84, No. 10, 2987--3007 (2022; Zbl 07596609) Full Text: DOI
Fekete, Sándor P.; Niehs, Eike; Scheffer, Christian; Schmidt, Arne Connected reconfiguration of lattice-based cellular structures by finite-memory robots. (English) Zbl 07596608 Algorithmica 84, No. 10, 2954-2986 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{S. P. Fekete} et al., Algorithmica 84, No. 10, 2954--2986 (2022; Zbl 07596608) Full Text: DOI
Bosman, Thomas; van Ee, Martijn; Jiao, Yang; Marchetti-Spaccamela, Alberto; Ravi, R.; Stougie, Leen Approximation algorithms for replenishment problems with fixed turnover times. (English) Zbl 07572795 Algorithmica 84, No. 9, 2597-2621 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{T. Bosman} et al., Algorithmica 84, No. 9, 2597--2621 (2022; Zbl 07572795) Full Text: DOI
Kobayashi, Yasuaki; Otachi, Yota Parameterized complexity of graph burning. (English) Zbl 07567468 Algorithmica 84, No. 8, 2379-2393 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{Y. Kobayashi} and \textit{Y. Otachi}, Algorithmica 84, No. 8, 2379--2393 (2022; Zbl 07567468) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Lochet, William; Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani Parameterized complexity of directed spanner problems. (English) Zbl 07567464 Algorithmica 84, No. 8, 2292-2308 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 84, No. 8, 2292--2308 (2022; Zbl 07567464) Full Text: DOI
Bożyk, Łukasz; Derbisz, Jan; Krawczyk, Tomasz; Novotná, Jana; Okrasa, Karolina Vertex deletion into bipartite permutation graphs. (English) Zbl 07567463 Algorithmica 84, No. 8, 2271-2291 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{Ł. Bożyk} et al., Algorithmica 84, No. 8, 2271--2291 (2022; Zbl 07567463) Full Text: DOI arXiv
Chen, Li-Hsuan; Hsieh, Sun-Yuan; Hung, Ling-Ju; Klasing, Ralf On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality. (English) Zbl 1492.68103 Algorithmica 84, No. 7, 1993-2027 (2022). MSC: 68R10 05C22 05C69 68Q17 68Q25 68W25 90B80 90C27 PDFBibTeX XMLCite \textit{L.-H. Chen} et al., Algorithmica 84, No. 7, 1993--2027 (2022; Zbl 1492.68103) Full Text: DOI
Boyar, Joan; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S. Relaxing the irrevocability requirement for online graph algorithms. (English) Zbl 1492.68145 Algorithmica 84, No. 7, 1916-1951 (2022). MSC: 68W27 05C69 05C70 05C85 68R10 PDFBibTeX XMLCite \textit{J. Boyar} et al., Algorithmica 84, No. 7, 1916--1951 (2022; Zbl 1492.68145) Full Text: DOI arXiv
Choudhary, Pratibha Polynomial time algorithms for tracking path problems. (English) Zbl 07535645 Algorithmica 84, No. 6, 1548-1570 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{P. Choudhary}, Algorithmica 84, No. 6, 1548--1570 (2022; Zbl 07535645) Full Text: DOI
Nutov, Zeev Approximating \(k\)-connected \(m\)-dominating sets. (English) Zbl 1500.68007 Algorithmica 84, No. 6, 1511-1525 (2022). Reviewer: Gunther Schmidt (München) MSC: 68R10 05C40 05C69 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{Z. Nutov}, Algorithmica 84, No. 6, 1511--1525 (2022; Zbl 1500.68007) Full Text: DOI arXiv
Halldórsson, Magnús M.; Ishii, Toshimasa; Makino, Kazuhisa; Takazawa, Kenjiro Posimodular function optimization. (English) Zbl 1491.68088 Algorithmica 84, No. 4, 1107-1131 (2022). MSC: 68Q25 68Q27 90C27 PDFBibTeX XMLCite \textit{M. M. Halldórsson} et al., Algorithmica 84, No. 4, 1107--1131 (2022; Zbl 1491.68088) Full Text: DOI
Kontogiannis, Spyros; Wagner, Dorothea; Zaroliagis, Christos An axiomatic approach to time-dependent shortest path oracles. (English) Zbl 1485.05044 Algorithmica 84, No. 3, 815-870 (2022). MSC: 05C12 05C85 05C38 68Q25 68R10 PDFBibTeX XMLCite \textit{S. Kontogiannis} et al., Algorithmica 84, No. 3, 815--870 (2022; Zbl 1485.05044) Full Text: DOI
Cairo, Massimo; Khan, Shahbaz; Rizzi, Romeo; Schmidt, Sebastian; Tomescu, Alexandru I. Safety in \(s\)-\(t\) paths, trails and walks. (English) Zbl 1518.68251 Algorithmica 84, No. 3, 719-741 (2022). MSC: 68R10 05C20 05C38 05C40 05C85 68Q25 92D10 PDFBibTeX XMLCite \textit{M. Cairo} et al., Algorithmica 84, No. 3, 719--741 (2022; Zbl 1518.68251) Full Text: DOI arXiv
Choi, Jongmin; Cabello, Sergio; Ahn, Hee-Kap Maximizing dominance in the plane and its applications. (English) Zbl 1518.68409 Algorithmica 83, No. 11, 3491-3513 (2021). MSC: 68U05 68R10 68W40 PDFBibTeX XMLCite \textit{J. Choi} et al., Algorithmica 83, No. 11, 3491--3513 (2021; Zbl 1518.68409) Full Text: DOI
Chaplick, Steven; Töpfer, Martin; Voborník, Jan; Zeman, Peter On \(H\)-topological intersection graphs. (English) Zbl 1518.05179 Algorithmica 83, No. 11, 3281-3318 (2021). MSC: 05C85 05C62 68Q25 68Q27 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Algorithmica 83, No. 11, 3281--3318 (2021; Zbl 1518.05179) Full Text: DOI
Casteigts, Arnaud; Himmel, Anne-Sophie; Molter, Hendrik; Zschoche, Philipp Finding temporal paths under waiting time constraints. (English) Zbl 1518.68254 Algorithmica 83, No. 9, 2754-2802 (2021). MSC: 68R10 05C38 05C85 68Q27 PDFBibTeX XMLCite \textit{A. Casteigts} et al., Algorithmica 83, No. 9, 2754--2802 (2021; Zbl 1518.68254) Full Text: DOI arXiv
Foucaud, Florent; Gras, Benjamin; Perez, Anthony; Sikora, Florian On the complexity of broadcast domination and multipacking in digraphs. (English) Zbl 1518.68262 Algorithmica 83, No. 9, 2651-2677 (2021). MSC: 68R10 05C12 05C20 05C85 05C70 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{F. Foucaud} et al., Algorithmica 83, No. 9, 2651--2677 (2021; Zbl 1518.68262) Full Text: DOI arXiv Link
Hörsch, Florian; Szigeti, Zoltán The \((2, k)\)-connectivity augmentation problem: algorithmic aspects. (English) Zbl 1518.05097 Algorithmica 83, No. 8, 2333-2350 (2021). MSC: 05C40 05C85 68W40 PDFBibTeX XMLCite \textit{F. Hörsch} and \textit{Z. Szigeti}, Algorithmica 83, No. 8, 2333--2350 (2021; Zbl 1518.05097) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A. Subexponential parameterized algorithms and kernelization on almost chordal graphs. (English) Zbl 1467.05254 Algorithmica 83, No. 7, 2170-2214 (2021). MSC: 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{P. A. Golovach}, Algorithmica 83, No. 7, 2170--2214 (2021; Zbl 1467.05254) Full Text: DOI arXiv
Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. On structural parameterizations of the edge disjoint paths problem. (English) Zbl 1516.68061 Algorithmica 83, No. 6, 1605-1637 (2021). MSC: 68R10 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Ganian} et al., Algorithmica 83, No. 6, 1605--1637 (2021; Zbl 1516.68061) Full Text: DOI
Demaine, Erik D.; Huang, Yamming; Liao, Chung-Shou; Sadakane, Kunihiko Approximating the Canadian traveller problem with online randomization. (English) Zbl 1512.68458 Algorithmica 83, No. 5, 1524-1543 (2021). MSC: 68W27 68W20 90C27 90C35 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Algorithmica 83, No. 5, 1524--1543 (2021; Zbl 1512.68458) Full Text: DOI Link
Chen, Chi-Yeh; Hsieh, Sun-Yuan; Le, Hoang-Oanh; Le, Van Bang; Peng, Sheng-Lung Matching cut in graphs with large minimum degree. (English) Zbl 1512.68202 Algorithmica 83, No. 5, 1238-1255 (2021). MSC: 68R10 05C70 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{C.-Y. Chen} et al., Algorithmica 83, No. 5, 1238--1255 (2021; Zbl 1512.68202) Full Text: DOI
Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. (English) Zbl 1512.68195 Algorithmica 83, No. 3, 822-852 (2021). MSC: 68R10 05C60 05C69 68Q25 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Algorithmica 83, No. 3, 822--852 (2021; Zbl 1512.68195) Full Text: DOI arXiv
Acan, Hüseyin; Chakraborty, Sankardeep; Jo, Seungbum; Satti, Srinivasa Rao Succinct encodings for families of interval graphs. (English) Zbl 1512.68061 Algorithmica 83, No. 3, 776-794 (2021). MSC: 68P05 05C62 05C85 68R10 68W05 PDFBibTeX XMLCite \textit{H. Acan} et al., Algorithmica 83, No. 3, 776--794 (2021; Zbl 1512.68061) Full Text: DOI
Ganian, Robert; Ordyniak, Sebastian The power of cut-based parameters for computing edge-disjoint paths. (English) Zbl 1512.68220 Algorithmica 83, No. 2, 726-752 (2021). MSC: 68R10 05C38 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Ganian} and \textit{S. Ordyniak}, Algorithmica 83, No. 2, 726--752 (2021; Zbl 1512.68220) Full Text: DOI
Bonnet, Édouard; Cabello, Sergio; Mohar, Bojan; Pérez-Rosés, Hebert The inverse Voronoi problem in graphs. I: Hardness. (English) Zbl 1455.68135 Algorithmica 82, No. 10, 3018-3040 (2020). MSC: 68R10 05C12 68Q17 68Q27 68U05 PDFBibTeX XMLCite \textit{É. Bonnet} et al., Algorithmica 82, No. 10, 3018--3040 (2020; Zbl 1455.68135) Full Text: DOI HAL
Bensmail, Julien; Mazauric, Dorian; Mc Inerney, Fionn; Nisse, Nicolas; Pérennes, Stéphane Sequential metric dimension. (English) Zbl 1459.05209 Algorithmica 82, No. 10, 2867-2901 (2020). MSC: 05C57 05C12 68Q17 PDFBibTeX XMLCite \textit{J. Bensmail} et al., Algorithmica 82, No. 10, 2867--2901 (2020; Zbl 1459.05209) Full Text: DOI HAL
Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Rzążewski, Paweł On cycle transversals and their connected variants in the absence of a small linear forest. (English) Zbl 1459.05332 Algorithmica 82, No. 10, 2841-2866 (2020). MSC: 05D15 05C38 68Q17 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., Algorithmica 82, No. 10, 2841--2866 (2020; Zbl 1459.05332) Full Text: DOI
Lin, Ching-Chi; Ku, Keng-Chu; Hsu, Chan-Hung Paired-domination problem on distance-hereditary graphs. (English) Zbl 1459.05242 Algorithmica 82, No. 10, 2809-2840 (2020). MSC: 05C69 05C70 05C12 05C85 68Q25 PDFBibTeX XMLCite \textit{C.-C. Lin} et al., Algorithmica 82, No. 10, 2809--2840 (2020; Zbl 1459.05242) Full Text: DOI
Hassin, Refael; Ravi, R.; Salman, F. Sibel; Segev, Danny The approximability of multiple facility location on directed networks with random arc failures. (English) Zbl 1453.68213 Algorithmica 82, No. 9, 2474-2501 (2020). MSC: 68W25 68Q17 90B80 90C35 90C39 PDFBibTeX XMLCite \textit{R. Hassin} et al., Algorithmica 82, No. 9, 2474--2501 (2020; Zbl 1453.68213) Full Text: DOI
Barbero, Florian; Isenmann, Lucas; Thiebaut, Jocelyn On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs. (English) Zbl 1452.68131 Algorithmica 82, No. 8, 2243-2266 (2020). MSC: 68R10 05C12 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{F. Barbero} et al., Algorithmica 82, No. 8, 2243--2266 (2020; Zbl 1452.68131) Full Text: DOI
Goyal, Keshav; Mömke, Tobias Robust reoptimization of Steiner trees. (English) Zbl 1442.68173 Algorithmica 82, No. 7, 1966-1988 (2020). MSC: 68R10 68W25 PDFBibTeX XMLCite \textit{K. Goyal} and \textit{T. Mömke}, Algorithmica 82, No. 7, 1966--1988 (2020; Zbl 1442.68173) Full Text: DOI
Hershberger, John; Kumar, Neeraj; Suri, Subhash Shortest paths in the plane with obstacle violations. (English) Zbl 1441.68265 Algorithmica 82, No. 7, 1813-1832 (2020). MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{J. Hershberger} et al., Algorithmica 82, No. 7, 1813--1832 (2020; Zbl 1441.68265) Full Text: DOI Link
Akhoondian Amiri, Saeed; Foerster, Klaus-Tycho; Schmid, Stefan Walking through waypoints. (English) Zbl 1436.68218 Algorithmica 82, No. 7, 1784-1812 (2020). MSC: 68R10 68Q25 90C27 PDFBibTeX XMLCite \textit{S. Akhoondian Amiri} et al., Algorithmica 82, No. 7, 1784--1812 (2020; Zbl 1436.68218) Full Text: DOI
Araújo, Júlio; Campos, Victor A.; Maia, Ana Karolinna; Sau, Ignasi; Silva, Ana On the complexity of finding internally vertex-disjoint long directed paths. (English) Zbl 1433.68164 Algorithmica 82, No. 6, 1616-1639 (2020). MSC: 68Q25 05C20 05C38 05C70 05C85 68Q17 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Araújo} et al., Algorithmica 82, No. 6, 1616--1639 (2020; Zbl 1433.68164) Full Text: DOI arXiv
Habib, Michel; Mouatadid, Lalla Maximum induced matching algorithms via vertex ordering characterizations. (English) Zbl 1433.68296 Algorithmica 82, No. 2, 260-278 (2020). MSC: 68R10 05C70 05C76 05C85 68Q25 68W40 PDFBibTeX XMLCite \textit{M. Habib} and \textit{L. Mouatadid}, Algorithmica 82, No. 2, 260--278 (2020; Zbl 1433.68296) Full Text: DOI arXiv
Yokoi, Yu Envy-free matchings with lower quotas. (English) Zbl 1433.91099 Algorithmica 82, No. 2, 188-211 (2020). MSC: 91B68 PDFBibTeX XMLCite \textit{Y. Yokoi}, Algorithmica 82, No. 2, 188--211 (2020; Zbl 1433.91099) Full Text: DOI arXiv Link
Baum, Moritz; Dibbelt, Julian; Pajor, Thomas; Sauer, Jonas; Wagner, Dorothea; Zündorf, Tobias Energy-optimal routes for battery electric vehicles. (English) Zbl 1435.90013 Algorithmica 82, No. 5, 1490-1546 (2020). MSC: 90B06 90C59 90B10 PDFBibTeX XMLCite \textit{M. Baum} et al., Algorithmica 82, No. 5, 1490--1546 (2020; Zbl 1435.90013) Full Text: DOI
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël Connected vertex cover for \((sP_1+P_5)\)-free graphs. (English) Zbl 1436.68245 Algorithmica 82, No. 1, 20-40 (2020). MSC: 68R10 05C70 05C85 68W40 PDFBibTeX XMLCite \textit{M. Johnson} et al., Algorithmica 82, No. 1, 20--40 (2020; Zbl 1436.68245) Full Text: DOI Link
Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha; Saurabh, Saket Parameterized complexity of geometric covering problems having conflicts. (English) Zbl 1436.68145 Algorithmica 82, No. 1, 1-19 (2020). MSC: 68Q27 68Q17 68R10 68U05 68W25 PDFBibTeX XMLCite \textit{A. Banik} et al., Algorithmica 82, No. 1, 1--19 (2020; Zbl 1436.68145) Full Text: DOI
Arumugam, Guru Prakash; Augustine, John; Golin, Mordecai J.; Srikanthan, Prashanth Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities. (English) Zbl 1431.90031 Algorithmica 81, No. 9, 3534-3585 (2019). MSC: 90B10 90C35 90C47 PDFBibTeX XMLCite \textit{G. P. Arumugam} et al., Algorithmica 81, No. 9, 3534--3585 (2019; Zbl 1431.90031) Full Text: DOI
Baïou, Mourad; Barahona, Francisco An algorithm to compute the nucleolus of shortest path games. (English) Zbl 1442.91007 Algorithmica 81, No. 8, 3099-3113 (2019). Reviewer: Sirma Zeynep Alparslan-Gok (Isparta) MSC: 91A12 91A68 PDFBibTeX XMLCite \textit{M. Baïou} and \textit{F. Barahona}, Algorithmica 81, No. 8, 3099--3113 (2019; Zbl 1442.91007) Full Text: DOI HAL
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor The homogeneous broadcast problem in narrow and wide strips. I: Algorithms. (English) Zbl 1421.68114 Algorithmica 81, No. 7, 2934-2962 (2019). MSC: 68R10 05C62 05C69 68W40 PDFBibTeX XMLCite \textit{M. de Berg} et al., Algorithmica 81, No. 7, 2934--2962 (2019; Zbl 1421.68114) Full Text: DOI
Chen, Danny Z.; Wang, Haitao Computing \(L_1\) shortest paths among polygonal obstacles in the plane. (English) Zbl 1421.68164 Algorithmica 81, No. 6, 2430-2483 (2019). MSC: 68U05 68P05 68W40 PDFBibTeX XMLCite \textit{D. Z. Chen} and \textit{H. Wang}, Algorithmica 81, No. 6, 2430--2483 (2019; Zbl 1421.68164) Full Text: DOI
Mertzios, George B.; Michail, Othon; Spirakis, Paul G. Temporal network optimization subject to connectivity constraints. (English) Zbl 1421.68139 Algorithmica 81, No. 4, 1416-1449 (2019). MSC: 68R10 05C12 05C40 05C78 68Q17 68W25 90C35 PDFBibTeX XMLCite \textit{G. B. Mertzios} et al., Algorithmica 81, No. 4, 1416--1449 (2019; Zbl 1421.68139) Full Text: DOI
Barba, Luis; Cardinal, Jean; Korman, Matias; Langerman, Stefan; van Renssen, André; Roeloffzen, Marcel; Verdonschot, Sander Dynamic graph coloring. (English) Zbl 1423.05059 Algorithmica 81, No. 4, 1319-1341 (2019). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{L. Barba} et al., Algorithmica 81, No. 4, 1319--1341 (2019; Zbl 1423.05059) Full Text: DOI
Halper, Austin; Mosteiro, Miguel A.; Rossikova, Yulia; Wong, Prudence W. H. Station assignment with reallocation. (English) Zbl 1425.90060 Algorithmica 81, No. 3, 1096-1125 (2019). MSC: 90B80 PDFBibTeX XMLCite \textit{A. Halper} et al., Algorithmica 81, No. 3, 1096--1125 (2019; Zbl 1425.90060) Full Text: DOI arXiv
Bampas, Evangelos; Czyzowicz, Jurek; Gąsieniec, Leszek; Ilcinkas, David; Klasing, Ralf; Kociumaka, Tomasz; Pająk, Dominik Linear search by a pair of distinct-speed robots. (English) Zbl 1412.68019 Algorithmica 81, No. 1, 317-342 (2019). MSC: 68M14 68Q25 68T40 90B40 PDFBibTeX XMLCite \textit{E. Bampas} et al., Algorithmica 81, No. 1, 317--342 (2019; Zbl 1412.68019) Full Text: DOI Link
Misra, Neeldhara; Panolan, Fahad; Rai, Ashutosh; Raman, Venkatesh; Saurabh, Saket Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs. (English) Zbl 1414.05128 Algorithmica 81, No. 1, 26-46 (2019). MSC: 05C17 05C85 05C15 68Q17 68W20 PDFBibTeX XMLCite \textit{N. Misra} et al., Algorithmica 81, No. 1, 26--46 (2019; Zbl 1414.05128) Full Text: DOI
Fukunaga, Takuro Approximation algorithms for highly connected multi-dominating sets in unit disk graphs. (English) Zbl 1414.05224 Algorithmica 80, No. 11, 3270-3292 (2018). MSC: 05C69 05C22 68W25 PDFBibTeX XMLCite \textit{T. Fukunaga}, Algorithmica 80, No. 11, 3270--3292 (2018; Zbl 1414.05224) Full Text: DOI arXiv
Mémoli, Facundo; Sidiropoulos, Anastasios; Sridhar, Vijay Quasimetric embeddings and their applications. (English) Zbl 1401.68255 Algorithmica 80, No. 12, 3803-3824 (2018). MSC: 68R10 05C10 68U05 PDFBibTeX XMLCite \textit{F. Mémoli} et al., Algorithmica 80, No. 12, 3803--3824 (2018; Zbl 1401.68255) Full Text: DOI Link
Dehghan, Ali; Sadeghi, Mohammad-Reza; Ahadi, Arash Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications. (English) Zbl 1400.68085 Algorithmica 80, No. 12, 3704-3727 (2018). MSC: 68Q25 05C21 05C70 68Q17 68R10 PDFBibTeX XMLCite \textit{A. Dehghan} et al., Algorithmica 80, No. 12, 3704--3727 (2018; Zbl 1400.68085) Full Text: DOI arXiv
Chandoo, Maurice Canonical representations for circular-arc graphs using flip sets. (English) Zbl 1397.05118 Algorithmica 80, No. 12, 3646-3672 (2018). MSC: 05C62 05C60 PDFBibTeX XMLCite \textit{M. Chandoo}, Algorithmica 80, No. 12, 3646--3672 (2018; Zbl 1397.05118) Full Text: DOI arXiv
Dvořák, Pavel; Knop, Dušan Parameterized complexity of length-bounded cuts and multicuts. (English) Zbl 1400.90258 Algorithmica 80, No. 12, 3597-3617 (2018). MSC: 90C27 90C35 05C12 PDFBibTeX XMLCite \textit{P. Dvořák} and \textit{D. Knop}, Algorithmica 80, No. 12, 3597--3617 (2018; Zbl 1400.90258) Full Text: DOI arXiv
Majumdar, Diptapriyo; Raman, Venkatesh Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization. (English) Zbl 1397.68106 Algorithmica 80, No. 9, 2683-2724 (2018). MSC: 68Q25 05C85 68R10 68Q17 PDFBibTeX XMLCite \textit{D. Majumdar} and \textit{V. Raman}, Algorithmica 80, No. 9, 2683--2724 (2018; Zbl 1397.68106) Full Text: DOI
Grimmer, Benjamin Dual-based approximation algorithms for cut-based network connectivity problems. (English) Zbl 1392.68324 Algorithmica 80, No. 10, 2849-2873 (2018). MSC: 68R10 68W25 PDFBibTeX XMLCite \textit{B. Grimmer}, Algorithmica 80, No. 10, 2849--2873 (2018; Zbl 1392.68324) Full Text: DOI arXiv
Levit, Vadim E.; Tankus, David Complexity results for generating subgraphs. (English) Zbl 1392.68192 Algorithmica 80, No. 8, 2384-2399 (2018). MSC: 68Q17 05C60 05C69 05C70 PDFBibTeX XMLCite \textit{V. E. Levit} and \textit{D. Tankus}, Algorithmica 80, No. 8, 2384--2399 (2018; Zbl 1392.68192) Full Text: DOI arXiv
Chaplick, Steven; Guśpiel, Grzegorz; Gutowski, Grzegorz; Krawczyk, Tomasz; Liotta, Giuseppe The partial visibility representation extension problem. (English) Zbl 1392.68322 Algorithmica 80, No. 8, 2286-2323 (2018). MSC: 68R10 05C62 68Q25 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Algorithmica 80, No. 8, 2286--2323 (2018; Zbl 1392.68322) Full Text: DOI arXiv
Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity. (English) Zbl 1393.68067 Algorithmica 80, No. 7, 2160-2180 (2018). MSC: 68Q25 05C07 05C20 05C85 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Algorithmica 80, No. 7, 2160--2180 (2018; Zbl 1393.68067) Full Text: DOI Link
Asahiro, Yuichi; Doi, Yuya; Miyano, Eiji; Samizo, Kazuaki; Shimizu, Hirotaka Optimal approximation algorithms for maximum distance-bounded subgraph problems. (English) Zbl 1394.68435 Algorithmica 80, No. 6, 1834-1856 (2018). MSC: 68W25 05C69 68W40 90C59 91D30 PDFBibTeX XMLCite \textit{Y. Asahiro} et al., Algorithmica 80, No. 6, 1834--1856 (2018; Zbl 1394.68435) Full Text: DOI
Chrobak, Marek; Costello, Kevin P. Faster information gathering in ad-hoc radio tree networks. (English) Zbl 1390.68056 Algorithmica 80, No. 3, 1013-1040 (2018). MSC: 68M10 68W40 90B18 PDFBibTeX XMLCite \textit{M. Chrobak} and \textit{K. P. Costello}, Algorithmica 80, No. 3, 1013--1040 (2018; Zbl 1390.68056) Full Text: DOI arXiv
Eppstein, David; Kindermann, Philipp; Kobourov, Stephen; Liotta, Giuseppe; Lubiw, Anna; Maignan, Aude; Mondal, Debajyoti; Vosoughpour, Hamideh; Whitesides, Sue; Wismath, Stephen On the planar split thickness of graphs. (English) Zbl 1390.68498 Algorithmica 80, No. 3, 977-994 (2018). MSC: 68R10 05C10 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Algorithmica 80, No. 3, 977--994 (2018; Zbl 1390.68498) Full Text: DOI arXiv
Schieber, Baruch; Shachnai, Hadas; Tamir, Gal; Tamir, Tami A theory and algorithms for combinatorial reoptimization. (English) Zbl 1396.90076 Algorithmica 80, No. 2, 576-607 (2018). MSC: 90C27 68W25 90C59 PDFBibTeX XMLCite \textit{B. Schieber} et al., Algorithmica 80, No. 2, 576--607 (2018; Zbl 1396.90076) Full Text: DOI Link
Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David F.; Matuschke, Jannik Matchings with lower quotas: algorithms and complexity. (English) Zbl 1386.68115 Algorithmica 80, No. 1, 185-208 (2018). MSC: 68R10 05C70 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{A. Arulselvan} et al., Algorithmica 80, No. 1, 185--208 (2018; Zbl 1386.68115) Full Text: DOI
Floderus, Peter; Jansson, Jesper; Levcopoulos, Christos; Lingas, Andrzej; Sledneu, Dzmitry 3D rectangulations and geometric matrix multiplication. (English) Zbl 1386.68195 Algorithmica 80, No. 1, 136-154 (2018). MSC: 68U05 68W25 68W40 PDFBibTeX XMLCite \textit{P. Floderus} et al., Algorithmica 80, No. 1, 136--154 (2018; Zbl 1386.68195) Full Text: DOI
Belmonte, Rémy; Otachi, Yota; Schweitzer, Pascal Induced minor free graphs: isomorphism and clique-width. (English) Zbl 1380.05183 Algorithmica 80, No. 1, 29-47 (2018). MSC: 05C83 05C60 05C69 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Algorithmica 80, No. 1, 29--47 (2018; Zbl 1380.05183) Full Text: DOI arXiv
Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket Quick but odd growth of cacti. (English) Zbl 1372.68136 Algorithmica 79, No. 1, 271-290 (2017). MSC: 68Q25 05C75 05C85 68W20 PDFBibTeX XMLCite \textit{S. Kolay} et al., Algorithmica 79, No. 1, 271--290 (2017; Zbl 1372.68136) Full Text: DOI Link
Suchý, Ondřej Extending the kernel for planar Steiner tree to the number of Steiner vertices. (English) Zbl 1372.68146 Algorithmica 79, No. 1, 189-210 (2017). MSC: 68Q25 05C10 05C85 68R10 PDFBibTeX XMLCite \textit{O. Suchý}, Algorithmica 79, No. 1, 189--210 (2017; Zbl 1372.68146) Full Text: DOI Link
Graf, Daniel How to sort by walking and swapping on paths and trees. (English) Zbl 1372.68075 Algorithmica 78, No. 4, 1151-1181 (2017). MSC: 68P10 68Q17 68R05 68R10 68T40 68W05 PDFBibTeX XMLCite \textit{D. Graf}, Algorithmica 78, No. 4, 1151--1181 (2017; Zbl 1372.68075) Full Text: DOI
Genova, Kyle; Williamson, David P. An experimental evaluation of the best-of-many Christofides’ algorithm for the traveling salesman problem. (English) Zbl 1372.90090 Algorithmica 78, No. 4, 1109-1130 (2017). MSC: 90C27 68W25 90C59 PDFBibTeX XMLCite \textit{K. Genova} and \textit{D. P. Williamson}, Algorithmica 78, No. 4, 1109--1130 (2017; Zbl 1372.90090) Full Text: DOI arXiv
Foucaud, Florent; Mertzios, George B.; Naserasr, Reza; Parreau, Aline; Valicov, Petru Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity. (English) Zbl 1371.05212 Algorithmica 78, No. 3, 914-944 (2017). MSC: 05C69 05C12 05C85 68Q25 PDFBibTeX XMLCite \textit{F. Foucaud} et al., Algorithmica 78, No. 3, 914--944 (2017; Zbl 1371.05212) Full Text: DOI arXiv Link
Even, Guy; Medina, Moti Online packet-routing in grids with bounded buffers. (English) Zbl 1372.68310 Algorithmica 78, No. 3, 819-868 (2017). MSC: 68W27 68M20 68W20 PDFBibTeX XMLCite \textit{G. Even} and \textit{M. Medina}, Algorithmica 78, No. 3, 819--868 (2017; Zbl 1372.68310) Full Text: DOI arXiv
Albers, Susanne; Hellwig, Matthias Online makespan minimization with parallel schedules. (English) Zbl 1370.68331 Algorithmica 78, No. 2, 492-520 (2017). MSC: 68W27 90B35 PDFBibTeX XMLCite \textit{S. Albers} and \textit{M. Hellwig}, Algorithmica 78, No. 2, 492--520 (2017; Zbl 1370.68331) Full Text: DOI arXiv
Scheifele, Rudolf Steiner trees with bounded RC-delay. (English) Zbl 1369.68355 Algorithmica 78, No. 1, 86-109 (2017). MSC: 68W25 68R10 PDFBibTeX XMLCite \textit{R. Scheifele}, Algorithmica 78, No. 1, 86--109 (2017; Zbl 1369.68355) Full Text: DOI
Kobayashi, Yusuke; Toyooka, Sho Finding a shortest non-zero path in group-labeled graphs via permanent computation. (English) Zbl 1360.05142 Algorithmica 77, No. 4, 1128-1142 (2017). MSC: 05C78 05C85 05C12 68W20 PDFBibTeX XMLCite \textit{Y. Kobayashi} and \textit{S. Toyooka}, Algorithmica 77, No. 4, 1128--1142 (2017; Zbl 1360.05142) Full Text: DOI Link
Blin, Lélia; Burman, Janna; Nisse, Nicolas Exclusive graph searching. (English) Zbl 1364.68304 Algorithmica 77, No. 3, 942-969 (2017). MSC: 68R10 05C85 68W40 PDFBibTeX XMLCite \textit{L. Blin} et al., Algorithmica 77, No. 3, 942--969 (2017; Zbl 1364.68304) Full Text: DOI
Sato, Shun Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors. (English) Zbl 1360.90228 Algorithmica 77, No. 3, 815-835 (2017). MSC: 90C27 PDFBibTeX XMLCite \textit{S. Sato}, Algorithmica 77, No. 3, 815--835 (2017; Zbl 1360.90228) Full Text: DOI
Wang, Hung-Lung An optimal algorithm for the weighted backup 2-center problem on a tree. (English) Zbl 1358.90069 Algorithmica 77, No. 2, 426-439 (2017). MSC: 90B80 PDFBibTeX XMLCite \textit{H.-L. Wang}, Algorithmica 77, No. 2, 426--439 (2017; Zbl 1358.90069) Full Text: DOI arXiv