Ji, Zhen; Klasing, Ralf; Li, Wen; Mao, Yaping; Zhang, Xiaoyan Erdös-Gallai-type problems for distance-edge-monitoring numbers. (English) Zbl 07794336 Discrete Appl. Math. 342, 275-285 (2024). MSC: 05C12 05C82 05C90 68R10 PDFBibTeX XMLCite \textit{Z. Ji} et al., Discrete Appl. Math. 342, 275--285 (2024; Zbl 07794336) Full Text: DOI
Yang, Chenxu; Klasing, Ralf; Mao, Yaping; Deng, Xingchao On the distance-edge-monitoring numbers of graphs. (English) Zbl 07794323 Discrete Appl. Math. 342, 153-167 (2024). MSC: 05C12 11J83 35A30 51K05 PDFBibTeX XMLCite \textit{C. Yang} et al., Discrete Appl. Math. 342, 153--167 (2024; Zbl 07794323) Full Text: DOI arXiv
Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna Geometric network creation games. (English) Zbl 07793140 SIAM J. Discrete Math. 38, No. 1, 277-315 (2024). MSC: 91A43 91A68 91A11 68Q17 PDFBibTeX XMLCite \textit{D. Bilò} et al., SIAM J. Discrete Math. 38, No. 1, 277--315 (2024; Zbl 07793140) Full Text: DOI arXiv
Bilò, Davide; D’Angelo, Gianlorenzo; Gualà, Luciano; Leucci, Stefano; Rossi, Mirko Blackout-tolerant temporal spanners. (English) Zbl 07792500 J. Comput. Syst. Sci. 141, Article ID 103495, 14 p. (2024). MSC: 68-XX PDFBibTeX XMLCite \textit{D. Bilò} et al., J. Comput. Syst. Sci. 141, Article ID 103495, 14 p. (2024; Zbl 07792500) Full Text: DOI
Gąsieniec, Leszek; Jurdziński, Tomasz; Klasing, Ralf; Levcopoulos, Christos; Lingas, Andrzej; Min, Jie; Radzik, Tomasz Perpetual maintenance of machines with different urgency requirements. (English) Zbl 07753726 J. Comput. Syst. Sci. 139, Article ID 103476, 20 p. (2024). MSC: 68-XX PDFBibTeX XMLCite \textit{L. Gąsieniec} et al., J. Comput. Syst. Sci. 139, Article ID 103476, 20 p. (2024; Zbl 07753726) Full Text: DOI
Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Zahn, Arthur The impact of cooperation in bilateral network creation. (English) Zbl 07824341 Oshman, Rotem (ed.) et al., Proceedings of the 42nd ACM symposium on principles of distributed computing, PODC ’23, Orlando, FL, USA, June 19–23, 2023. New York, NY: Association for Computing Machinery (ACM). 321-331 (2023). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{T. Friedrich} et al., in: Proceedings of the 42nd ACM symposium on principles of distributed computing, PODC '23, Orlando, FL, USA, June 19--23, 2023. New York, NY: Association for Computing Machinery (ACM). 321--331 (2023; Zbl 07824341) Full Text: DOI arXiv
Izumi, Taisuke; Emek, Yuval; Wadayama, Tadashi; Masuzawa, Toshimitsu Deterministic fault-tolerant connectivity labeling scheme. (English) Zbl 07824326 Oshman, Rotem (ed.) et al., Proceedings of the 42nd ACM symposium on principles of distributed computing, PODC ’23, Orlando, FL, USA, June 19–23, 2023. New York, NY: Association for Computing Machinery (ACM). 190-199 (2023). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{T. Izumi} et al., in: Proceedings of the 42nd ACM symposium on principles of distributed computing, PODC '23, Orlando, FL, USA, June 19--23, 2023. New York, NY: Association for Computing Machinery (ACM). 190--199 (2023; Zbl 07824326) Full Text: DOI arXiv
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Sciarria, Luca Pepè Finding diameter-reducing shortcuts in trees. (English) Zbl 07789703 Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 164-178 (2023). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{D. Bilò} et al., Lect. Notes Comput. Sci. 14079, 164--178 (2023; Zbl 07789703) Full Text: DOI arXiv
Bilò, Davide; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Krogmann, Simon; Schirneck, Martin Compact distance oracles with large sensitivity and low stretch. (English) Zbl 07789702 Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 149-163 (2023). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{D. Bilò} et al., Lect. Notes Comput. Sci. 14079, 149--163 (2023; Zbl 07789702) Full Text: DOI arXiv
Kanellopoulos, Panagiotis; Kyropoulou, Maria; Voudouris, Alexandros A. Not all strangers are the same: the impact of tolerance in Schelling games. (English) Zbl 07729841 Theor. Comput. Sci. 971, Article ID 114065, 18 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Kanellopoulos} et al., Theor. Comput. Sci. 971, Article ID 114065, 18 p. (2023; Zbl 07729841) Full Text: DOI arXiv
Jansson, Jesper; Levcopoulos, Christos; Lingas, Andrzej Online and approximate network construction from bounded connectivity constraints. (English) Zbl 07729634 Int. J. Found. Comput. Sci. 34, No. 5, 453-468 (2023). MSC: 68Qxx 68Rxx 90Cxx PDFBibTeX XMLCite \textit{J. Jansson} et al., Int. J. Found. Comput. Sci. 34, No. 5, 453--468 (2023; Zbl 07729634) Full Text: DOI
Foucaud, Florent; Narayanan, Krishna; Sulochana, Lekshmi Ramasubramony Monitoring edge-geodetic sets in graphs. (English) Zbl 07728667 Bagchi, Amitabha (ed.) et al., Algorithms and discrete applied mathematics. 9th international conference, CALDAM 2023, Gandhinagar, India, February 9–11, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13947, 245-256 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. Foucaud} et al., Lect. Notes Comput. Sci. 13947, 245--256 (2023; Zbl 07728667) Full Text: DOI arXiv
Gudmundsson, Joachim; Sha, Yuan Algorithms for radius-optimally augmenting trees in a metric space. (English) Zbl 1519.05234 Comput. Geom. 114, Article ID 102018, 10 p. (2023). MSC: 05C85 68R10 68W05 PDFBibTeX XMLCite \textit{J. Gudmundsson} and \textit{Y. Sha}, Comput. Geom. 114, Article ID 102018, 10 p. (2023; Zbl 1519.05234) Full Text: DOI
Gudmundsson, Joachim; Sha, Yuan Augmenting graphs to minimize the radius. (English) Zbl 1518.05180 Comput. Geom. 113, Article ID 101996, 14 p. (2023). MSC: 05C85 68R10 68W25 05C12 05C35 PDFBibTeX XMLCite \textit{J. Gudmundsson} and \textit{Y. Sha}, Comput. Geom. 113, Article ID 101996, 14 p. (2023; Zbl 1518.05180) Full Text: DOI
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
Àlvarez, Carme; Messegué Buisan, Arnau On the PoA conjecture: trees versus biconnected components. (English) Zbl 07700270 SIAM J. Discrete Math. 37, No. 2, 1030-1052 (2023). MSC: 68Q25 68R10 68U05 PDFBibTeX XMLCite \textit{C. Àlvarez} and \textit{A. Messegué Buisan}, SIAM J. Discrete Math. 37, No. 2, 1030--1052 (2023; Zbl 07700270) Full Text: DOI
Blažej, Václav; Choudhary, Pratibha; Knop, Dušan; Křišťan, Jan Matyáš; Suchý, Ondřej; Valla, Tomáš Constant factor approximation for tracking paths and fault tolerant feedback vertex set. (English) Zbl 1509.05085 Discrete Optim. 47, Article ID 100756, 16 p. (2023). MSC: 05C22 68W25 68Q25 90C27 PDFBibTeX XMLCite \textit{V. Blažej} et al., Discrete Optim. 47, Article ID 100756, 16 p. (2023; Zbl 1509.05085) Full Text: DOI
Choudhary, Pratibha; Goodrich, Michael T.; Gupta, Siddharth; Khodabandeh, Hadi; Matias, Pedro; Raman, Venkatesh Improved kernels for tracking paths. (English) Zbl 07649515 Inf. Process. Lett. 181, Article ID 106360, 11 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Choudhary} et al., Inf. Process. Lett. 181, Article ID 106360, 11 p. (2023; Zbl 07649515) Full Text: DOI
Böhnlein, Toni; Schaudt, Oliver; Schauer, Joachim Stackelberg packing games. (English) Zbl 1517.91019 Theor. Comput. Sci. 943, 16-35 (2023). MSC: 91B24 91A65 91A80 PDFBibTeX XMLCite \textit{T. Böhnlein} et al., Theor. Comput. Sci. 943, 16--35 (2023; Zbl 1517.91019) Full Text: DOI
Bläsius, Thomas; Friedrich, Tobias; Krejca, Martin S.; Molitor, Louise The impact of geometry on monochrome regions in the flip Schelling process. (English) Zbl 1500.91098 Comput. Geom. 108, Article ID 101902, 17 p. (2023). Reviewer: Dalkhat M. Ediev (Cherkessk) MSC: 91D20 05C90 PDFBibTeX XMLCite \textit{T. Bläsius} et al., Comput. Geom. 108, Article ID 101902, 17 p. (2023; Zbl 1500.91098) Full Text: DOI
Bilò, Davide; D’Angelo, Gianlorenzo; Gualà, Luciano; Leucci, Stefano; Rossi, Mirko Blackout-tolerant temporal spanners. (English) Zbl 07722890 Erlebach, Thomas (ed.) et al., Algorithmics of wireless networks. 18th international symposium on algorithmics of wireless networks, ALGOSENSORS 2022, Potsdam, Germany, September 8–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13707, 31-44 (2022). MSC: 68M18 68T40 PDFBibTeX XMLCite \textit{D. Bilò} et al., Lect. Notes Comput. Sci. 13707, 31--44 (2022; Zbl 07722890) Full Text: DOI
Wang, Qian On tree equilibria in max-distance network creation games. (English) Zbl 1520.91083 Kanellopoulos, Panagiotis (ed.) et al., Algorithmic game theory. 15th international symposium, SAGT 2022, Colchester, UK, September 12–15, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13584, 293-310 (2022). MSC: 91A43 91A68 PDFBibTeX XMLCite \textit{Q. Wang}, Lect. Notes Comput. Sci. 13584, 293--310 (2022; Zbl 1520.91083) Full Text: DOI arXiv
Dippel, Jack; Vetta, Adrian An improved bound for the tree conjecture in network creation games. (English) Zbl 1520.91078 Kanellopoulos, Panagiotis (ed.) et al., Algorithmic game theory. 15th international symposium, SAGT 2022, Colchester, UK, September 12–15, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13584, 241-257 (2022). MSC: 91A43 91A68 PDFBibTeX XMLCite \textit{J. Dippel} and \textit{A. Vetta}, Lect. Notes Comput. Sci. 13584, 241--257 (2022; Zbl 1520.91078) Full Text: DOI arXiv
Banerjee, Niranka; Gupta, Manoj; Raman, Venkatesh; Saurabh, Saket Output sensitive fault tolerant maximum matching. (English) Zbl 07615734 Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 17th international computer science symposium in Russia, CSR 2022, virtual event, June 29 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13296, 115-132 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{N. Banerjee} et al., Lect. Notes Comput. Sci. 13296, 115--132 (2022; Zbl 07615734) Full Text: DOI
Choudhary, Pratibha; Raman, Venkatesh Structural parameterizations of Tracking Paths problem. (English) Zbl 07597113 Theor. Comput. Sci. 934, 91-102 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Choudhary} and \textit{V. Raman}, Theor. Comput. Sci. 934, 91--102 (2022; Zbl 07597113) Full Text: DOI arXiv
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko New approximation algorithms for the heterogeneous weighted delivery problem. (English) Zbl 07585798 Theor. Comput. Sci. 932, 102-115 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Bilò} et al., Theor. Comput. Sci. 932, 102--115 (2022; Zbl 07585798) Full Text: DOI
Bilò, Davide Almost optimal algorithms for diameter-optimally augmenting trees. (English) Zbl 07579633 Theor. Comput. Sci. 931, 31-48 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Bilò}, Theor. Comput. Sci. 931, 31--48 (2022; Zbl 07579633) Full Text: DOI arXiv
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
Foucaud, Florent; Kao, Shih-Shun; Klasing, Ralf; Miller, Mirka; Ryan, Joe Monitoring the edges of a graph using distances. (English) Zbl 1494.05033 Discrete Appl. Math. 319, 424-438 (2022). MSC: 05C12 05C38 68Q25 PDFBibTeX XMLCite \textit{F. Foucaud} et al., Discrete Appl. Math. 319, 424--438 (2022; Zbl 1494.05033) 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
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido Multiple-edge-fault-tolerant approximate shortest-path trees. (English) Zbl 1518.68248 Algorithmica 84, No. 1, 37-59 (2022). MSC: 68R10 05C85 68M15 68P05 68W40 PDFBibTeX XMLCite \textit{D. Bilò} et al., Algorithmica 84, No. 1, 37--59 (2022; Zbl 1518.68248) Full Text: DOI Link
Interian, Ruben; Moreno, Jorge R.; Ribeiro, Celso C. Polarization reduction by minimum-cardinality edge additions: complexity and integer programming approaches. (English) Zbl 07768635 Int. Trans. Oper. Res. 28, No. 3, 1242-1264 (2021). MSC: 90-XX PDFBibTeX XMLCite \textit{R. Interian} et al., Int. Trans. Oper. Res. 28, No. 3, 1242--1264 (2021; Zbl 07768635) Full Text: DOI
Labbé, Martine; Pozo, Miguel A.; Puerto, Justo Computational comparisons of different formulations for the Stackelberg minimum spanning tree game. (English) Zbl 07768498 Int. Trans. Oper. Res. 28, No. 1, 48-69 (2021). MSC: 90-XX PDFBibTeX XMLCite \textit{M. Labbé} et al., Int. Trans. Oper. Res. 28, No. 1, 48--69 (2021; Zbl 07768498) Full Text: DOI
Coleman, Jared; Kranakis, Evangelos; Krizanc, Danny; Ponce, Oscar Morales Message delivery in the plane by robots with different speeds. (English) Zbl 1521.68223 Johnen, Colette (ed.) et al., Stabilization, safety, and security of distributed systems. 23rd international symposium, SSS 2021, virtual event, November 17–20, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13046, 305-319 (2021). MSC: 68T40 68M14 68W27 PDFBibTeX XMLCite \textit{J. Coleman} et al., Lect. Notes Comput. Sci. 13046, 305--319 (2021; Zbl 1521.68223) Full Text: DOI arXiv
Blažej, Václav; Choudhary, Pratibha; Knop, Dušan; Křišt’an, Jan Matyáš; Suchý, Ondřej; Valla, Tomáš Constant factor approximation for tracking paths and fault tolerant feedback vertex set. (English) Zbl 07603882 Koenemann, Jochen (ed.) et al., Approximation and online algorithms. 19th international workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12982, 23-38 (2021). MSC: 68W25 68W27 PDFBibTeX XMLCite \textit{V. Blažej} et al., Lect. Notes Comput. Sci. 12982, 23--38 (2021; Zbl 07603882) Full Text: DOI arXiv
Gudmundsson, Joachim; Sha, Yuan Algorithms for radius-optimally augmenting trees in a metric space. (English) Zbl 07498696 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 457-470 (2021). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{J. Gudmundsson} and \textit{Y. Sha}, Lect. Notes Comput. Sci. 12808, 457--470 (2021; Zbl 07498696) Full Text: DOI
Goodrich, Michael T.; Gupta, Siddharth; Khodabandeh, Hadi; Matias, Pedro How to catch marathon cheaters: new approximation algorithms for tracking paths. (English) Zbl 07498695 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 442-456 (2021). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{M. T. Goodrich} et al., Lect. Notes Comput. Sci. 12808, 442--456 (2021; Zbl 07498695) Full Text: DOI arXiv
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko New approximation algorithms for the heterogeneous weighted delivery problem. (English) Zbl 07495139 Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 167-184 (2021). MSC: 68Mxx 68Q11 68R10 PDFBibTeX XMLCite \textit{D. Bilò} et al., Lect. Notes Comput. Sci. 12810, 167--184 (2021; Zbl 07495139) Full Text: DOI
Àlvarez, Carme; Duch, Amalia Some results of Maria Serna on strategic games: complexity of equilibria and models. (English) Zbl 1486.91015 Comput. Sci. Rev. 39, Article ID 100346, 10 p. (2021). MSC: 91A40 91A43 91A68 PDFBibTeX XMLCite \textit{C. Àlvarez} and \textit{A. Duch}, Comput. Sci. Rev. 39, Article ID 100346, 10 p. (2021; Zbl 1486.91015) Full Text: DOI
Agarwal, Aishwarya; Elkind, Edith; Gan, Jiarui; Igarashi, Ayumi; Suksompong, Warut; Voudouris, Alexandros A. Schelling games on graphs. (English) Zbl 1481.91037 Artif. Intell. 301, Article ID 103576, 32 p. (2021). MSC: 91A43 91B15 05C57 68Q17 PDFBibTeX XMLCite \textit{A. Agarwal} et al., Artif. Intell. 301, Article ID 103576, 32 p. (2021; Zbl 1481.91037) Full Text: DOI arXiv
van Ee, Martijn A 12/7-approximation algorithm for the discrete bamboo garden trimming problem. (English) Zbl 1525.90225 Oper. Res. Lett. 49, No. 5, 645-649 (2021). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{M. van Ee}, Oper. Res. Lett. 49, No. 5, 645--649 (2021; Zbl 1525.90225) Full Text: DOI arXiv
Wang, Haitao; Zhao, Yiming Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees. (English) Zbl 1514.68228 Theor. Comput. Sci. 890, 192-209 (2021). MSC: 68R10 05C12 05C85 68W40 PDFBibTeX XMLCite \textit{H. Wang} and \textit{Y. Zhao}, Theor. Comput. Sci. 890, 192--209 (2021; Zbl 1514.68228) Full Text: DOI arXiv
Abu-Affash, A. Karim; Carmi, Paz; Katz, Matthew J. Minimizing total interference in asymmetric sensor networks. (English) Zbl 1514.68307 Theor. Comput. Sci. 889, 171-181 (2021). MSC: 68U05 68M18 68Q17 68W25 PDFBibTeX XMLCite \textit{A. K. Abu-Affash} et al., Theor. Comput. Sci. 889, 171--181 (2021; Zbl 1514.68307) Full Text: DOI arXiv
Wang, Haitao; Zhao, Yiming Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees. (English) Zbl 07405949 Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 27-39 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{H. Wang} and \textit{Y. Zhao}, Lect. Notes Comput. Sci. 12635, 27--39 (2021; Zbl 07405949) Full Text: DOI arXiv
Johnson, Christopher; Wang, Haitao A linear-time algorithm for radius-optimally augmenting paths in a metric space. (English) Zbl 1473.05293 Comput. Geom. 96, Article ID 101759, 21 p. (2021). MSC: 05C85 05C38 05C12 05C35 PDFBibTeX XMLCite \textit{C. Johnson} and \textit{H. Wang}, Comput. Geom. 96, Article ID 101759, 21 p. (2021; Zbl 1473.05293) Full Text: DOI arXiv
Bullinger, Martin; Suksompong, Warut; Voudouris, Alexandros A. Welfare guarantees in Schelling segregation. (English) Zbl 1521.91102 J. Artif. Intell. Res. (JAIR) 71, 143-174 (2021). MSC: 91B15 91D25 PDFBibTeX XMLCite \textit{M. Bullinger} et al., J. Artif. Intell. Res. (JAIR) 71, 143--174 (2021; Zbl 1521.91102) Full Text: DOI arXiv
Kanellopoulos, Panagiotis; Kyropoulou, Maria; Voudouris, Alexandros A. Modified Schelling games. (English) Zbl 1512.91021 Theor. Comput. Sci. 880, 1-19 (2021). MSC: 91A43 91A44 91A68 PDFBibTeX XMLCite \textit{P. Kanellopoulos} et al., Theor. Comput. Sci. 880, 1--19 (2021; Zbl 1512.91021) Full Text: DOI arXiv Link
Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Labourel, Arnaud; Mihalák, Matúš Collaborative delivery on a fixed path with homogeneous energy-constrained agents. (English) Zbl 1497.68371 Theor. Comput. Sci. 868, 87-96 (2021). MSC: 68R10 68W25 68W40 90B35 90C27 PDFBibTeX XMLCite \textit{J. Chalopin} et al., Theor. Comput. Sci. 868, 87--96 (2021; Zbl 1497.68371) Full Text: DOI HAL
Böhnlein, Toni; Kratsch, Stefan; Schaudt, Oliver Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting. (English) Zbl 1509.91008 Math. Program. 187, No. 1-2 (A), 653-695 (2021). MSC: 91A65 91B24 68Q27 68W25 PDFBibTeX XMLCite \textit{T. Böhnlein} et al., Math. Program. 187, No. 1--2 (A), 653--695 (2021; Zbl 1509.91008) Full Text: DOI
Kulik, Ariel; Shachnai, Hadas; Tamir, Gal On Lagrangian relaxation for constrained maximization and reoptimization problems. (English) Zbl 1464.90098 Discrete Appl. Math. 296, 164-178 (2021). MSC: 90C30 90C27 PDFBibTeX XMLCite \textit{A. Kulik} et al., Discrete Appl. Math. 296, 164--178 (2021; Zbl 1464.90098) Full Text: DOI
Bärtschi, Andreas; Bampas, Evangelos; Chalopin, Jérémie; Das, Shantanu; Karousatou, Christina; Mihalák, Matúš Near-gathering of energy-constrained mobile agents. (English) Zbl 1464.68436 Theor. Comput. Sci. 849, 35-46 (2021). MSC: 68W15 05C85 68Q25 68R10 68T40 68W25 PDFBibTeX XMLCite \textit{A. Bärtschi} et al., Theor. Comput. Sci. 849, 35--46 (2021; Zbl 1464.68436) Full Text: DOI HAL
Choudhary, Pratibha Polynomial time algorithms for tracking path problems. (English) Zbl 07601006 Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 166-179 (2020). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{P. Choudhary}, Lect. Notes Comput. Sci. 12126, 166--179 (2020; Zbl 07601006) Full Text: DOI arXiv
Böhnlein, Toni; Schaudt, Oliver On the complexity of Stackelberg matroid pricing problems. (English) Zbl 07601000 Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 83-96 (2020). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{T. Böhnlein} and \textit{O. Schaudt}, Lect. Notes Comput. Sci. 12126, 83--96 (2020; Zbl 07601000) Full Text: DOI
Yoshimura, Shotaro; Yamauchi, Yukiko Network creation games with local information and edge swaps. (English) Zbl 07581075 Richa, Andrea Werneck (ed.) et al., Structural information and communication complexity. 27th international colloquium, SIROCCO 2020, Paderborn, Germany, June 29 – July 1, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12156, 349-365 (2020). MSC: 68Mxx 68Q11 68R10 PDFBibTeX XMLCite \textit{S. Yoshimura} and \textit{Y. Yamauchi}, Lect. Notes Comput. Sci. 12156, 349--365 (2020; Zbl 07581075) Full Text: DOI arXiv
Wang, Haitao; Zhao, Yiming A linear-time algorithm for discrete radius optimally augmenting paths in a metric space. (English) Zbl 1508.68390 Int. J. Comput. Geom. Appl. 30, No. 3-4, 167-182 (2020). MSC: 68U05 05C85 68R10 PDFBibTeX XMLCite \textit{H. Wang} and \textit{Y. Zhao}, Int. J. Comput. Geom. Appl. 30, No. 3--4, 167--182 (2020; Zbl 1508.68390) Full Text: DOI arXiv
Ahmed, Reyan; Bodwin, Greg; Sahneh, Faryad Darabi; Hamm, Keaton; Jebelli, Mohammad Javad Latifi; Kobourov, Stephen; Spence, Richard Graph spanners: a tutorial review. (English) Zbl 1478.68206 Comput. Sci. Rev. 37, Article ID 100253, 29 p. (2020). MSC: 68R10 68-02 PDFBibTeX XMLCite \textit{R. Ahmed} et al., Comput. Sci. Rev. 37, Article ID 100253, 29 p. (2020; Zbl 1478.68206) Full Text: DOI arXiv
Duan, Ran; Pettie, Seth Connectivity oracles for graphs subject to vertex failures. (English) Zbl 1467.68139 SIAM J. Comput. 49, No. 6, 1363-1396 (2020). Reviewer: Peter Sanders (Karlsruhe) MSC: 68R10 05C40 05C85 68P05 68U05 PDFBibTeX XMLCite \textit{R. Duan} and \textit{S. Pettie}, SIAM J. Comput. 49, No. 6, 1363--1396 (2020; Zbl 1467.68139) Full Text: DOI
Bichler, Martin; Hao, Zhen; Littmann, Richard; Waldherr, Stefan Strategyproof auction mechanisms for network procurement. (English) Zbl 1456.90096 OR Spectrum 42, No. 4, 965-994 (2020). MSC: 90B80 90B10 PDFBibTeX XMLCite \textit{M. Bichler} et al., OR Spectrum 42, No. 4, 965--994 (2020; Zbl 1456.90096) Full Text: DOI
Parter, Merav; Peleg, David Fault tolerant approximate BFS structures with additive stretch. (English) Zbl 1494.68027 Algorithmica 82, No. 12, 3458-3491 (2020). MSC: 68M15 68R10 PDFBibTeX XMLCite \textit{M. Parter} and \textit{D. Peleg}, Algorithmica 82, No. 12, 3458--3491 (2020; Zbl 1494.68027) Full Text: DOI
Banik, Aritra; Choudhary, Pratibha; Raman, Venkatesh; Saurabh, Saket Fixed-parameter tractable algorithms for tracking shortest paths. (English) Zbl 1464.68274 Theor. Comput. Sci. 846, 1-13 (2020). MSC: 68R10 05C38 68Q27 PDFBibTeX XMLCite \textit{A. Banik} et al., Theor. Comput. Sci. 846, 1--13 (2020; Zbl 1464.68274) Full Text: DOI arXiv
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido Tracking routes in communication networks. (English) Zbl 1467.68135 Theor. Comput. Sci. 844, 1-15 (2020). MSC: 68R10 68Q17 68W25 90B18 90C35 PDFBibTeX XMLCite \textit{D. Bilò} et al., Theor. Comput. Sci. 844, 1--15 (2020; Zbl 1467.68135) Full Text: DOI
Almanza, Matteo; Leucci, Stefano; Panconesi, Alessandro Tracks from hell – when finding a proof may be easier than checking it. (English) Zbl 1453.68090 Theor. Comput. Sci. 839, 21-29 (2020). MSC: 68Q25 68Q17 91A43 PDFBibTeX XMLCite \textit{M. Almanza} et al., Theor. Comput. Sci. 839, 21--29 (2020; Zbl 1453.68090) Full Text: DOI Link
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
Datta, Ajoy K.; Ferragina, Paolo; Larmore, Lawrence; Pagli, Linda; Prencipe, Giuseppe Linear time distributed swap edge algorithms. (English) Zbl 1441.68173 Inf. Process. Lett. 161, Article ID 105979, 8 p. (2020). MSC: 68R10 05C40 05C76 05C85 68M15 68W15 PDFBibTeX XMLCite \textit{A. K. Datta} et al., Inf. Process. Lett. 161, Article ID 105979, 8 p. (2020; Zbl 1441.68173) Full Text: DOI
Weimann, Oren; Yuster, Raphael Incremental distance products via faulty shortest paths. (English) Zbl 1441.68198 Inf. Process. Lett. 161, Article ID 105977, 5 p. (2020). MSC: 68R10 05C12 05C40 05C76 05C85 68M15 68P10 PDFBibTeX XMLCite \textit{O. Weimann} and \textit{R. Yuster}, Inf. Process. Lett. 161, Article ID 105977, 5 p. (2020; Zbl 1441.68198) Full Text: DOI
Abu-Khzam, Faisal N.; Bazgan, Cristina; Fernau, Henning Parameterized dynamic variants of red-blue dominating set. (English) Zbl 1440.68134 Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 236-247 (2020). MSC: 68Q27 05C69 PDFBibTeX XMLCite \textit{F. N. Abu-Khzam} et al., Lect. Notes Comput. Sci. 12011, 236--247 (2020; Zbl 1440.68134) Full Text: DOI Link
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
Bilò, Davide; Lenzner, Pascal On the tree conjecture for the network creation game. (English) Zbl 1443.91071 Theory Comput. Syst. 64, No. 3, 422-443 (2020). Reviewer: Vladimír Lacko (Košice) MSC: 91A43 91A68 05C90 PDFBibTeX XMLCite \textit{D. Bilò} and \textit{P. Lenzner}, Theory Comput. Syst. 64, No. 3, 422--443 (2020; Zbl 1443.91071) Full Text: DOI Link
Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido An improved algorithm for computing all the best swap edges of a tree spanner. (English) Zbl 1433.68281 Algorithmica 82, No. 2, 279-299 (2020). MSC: 68R10 68W40 PDFBibTeX XMLCite \textit{D. Bilò} et al., Algorithmica 82, No. 2, 279--299 (2020; Zbl 1433.68281) Full Text: DOI Link
Bärtschi, Andreas; Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Geissmann, Barbara; Graf, Daniel; Labourel, Arnaud; Mihalák, Matúš Collaborative delivery with energy-constrained mobile robots. (English) Zbl 1437.68034 Theor. Comput. Sci. 810, 2-14 (2020). MSC: 68M20 68T42 68W40 90C27 PDFBibTeX XMLCite \textit{A. Bärtschi} et al., Theor. Comput. Sci. 810, 2--14 (2020; Zbl 1437.68034) Full Text: DOI arXiv
Baswana, Surender; Gupta, Shiv; Tulsyan, Ayush Fault tolerant and fully dynamic DFS in undirected graphs: simple yet efficient. (English) Zbl 07561709 Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 65, 16 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Baswana} et al., LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 65, 16 p. (2019; Zbl 07561709) Full Text: DOI arXiv
Pushparaj Shetty, D.; Lakshmi, M. Prasanna Minimizing the maximum sender interference by deploying additional nodes in a wireless sensor network. (English) Zbl 1468.90037 Electron. J. Graph Theory Appl. 7, No. 1, 169-182 (2019). MSC: 90B18 05C85 PDFBibTeX XMLCite \textit{D. Pushparaj Shetty} and \textit{M. P. Lakshmi}, Electron. J. Graph Theory Appl. 7, No. 1, 169--182 (2019; Zbl 1468.90037) 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 1520.68107 Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 10, 14 p. (2019). MSC: 68R10 05C12 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{F. Barbero} et al., LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 10, 14 p. (2019; Zbl 1520.68107) Full Text: DOI arXiv
Àlvarez, Carme; Messegué, Arnau On the price of anarchy for high-price links. (English) Zbl 1435.91034 Caragiannis, Ioannis (ed.) et al., Web and Internet economics. 15th international conference, WINE 2019, New York, NY, USA, December 10–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11920, 316-329 (2019). MSC: 91A43 PDFBibTeX XMLCite \textit{C. Àlvarez} and \textit{A. Messegué}, Lect. Notes Comput. Sci. 11920, 316--329 (2019; Zbl 1435.91034) Full Text: DOI arXiv
Abam, Mohammad Ali; Qafari, Mahnaz Sadat Geometric spanner games. (English) Zbl 1435.91009 Theor. Comput. Sci. 795, 398-407 (2019). Reviewer: Valerii V. Obukhovskij (Voronezh) MSC: 91A10 91A11 91A43 PDFBibTeX XMLCite \textit{M. A. Abam} and \textit{M. S. Qafari}, Theor. Comput. Sci. 795, 398--407 (2019; Zbl 1435.91009) Full Text: DOI
Lavrov, Mikhail; Loh, Po-Shen; Messegué, Arnau Distance-uniform graphs with large diameter. (English) Zbl 1419.05063 SIAM J. Discrete Math. 33, No. 2, 994-1005 (2019). MSC: 05C12 05C35 90B10 PDFBibTeX XMLCite \textit{M. Lavrov} et al., SIAM J. Discrete Math. 33, No. 2, 994--1005 (2019; Zbl 1419.05063) Full Text: DOI arXiv
D’Emidio, Mattia; Forlizzi, Luca; Frigioni, Daniele; Leucci, Stefano; Proietti, Guido Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. (English) Zbl 1426.90244 J. Comb. Optim. 38, No. 1, 165-184 (2019). MSC: 90C35 90B10 90C59 PDFBibTeX XMLCite \textit{M. D'Emidio} et al., J. Comb. Optim. 38, No. 1, 165--184 (2019; Zbl 1426.90244) Full Text: DOI arXiv
Große, Ulrike; Knauer, Christian; Stehn, Fabian; Gudmundsson, Joachim; Smid, Michiel Fast algorithms for diameter-optimally augmenting paths and trees. (English) Zbl 1415.68254 Int. J. Found. Comput. Sci. 30, No. 2, 293-313 (2019). MSC: 68U05 68R10 68W40 PDFBibTeX XMLCite \textit{U. Große} et al., Int. J. Found. Comput. Sci. 30, No. 2, 293--313 (2019; Zbl 1415.68254) Full Text: DOI arXiv
Dai, Wenkai; Yang, Yongjie Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications. (English) Zbl 1422.90061 J. Comb. Optim. 37, No. 2, 601-619 (2019). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{W. Dai} and \textit{Y. Yang}, J. Comb. Optim. 37, No. 2, 601--619 (2019; Zbl 1422.90061) Full Text: DOI
Ravelo, Santiago Valdés; Ferreira, Carlos Eduardo A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem. (English) Zbl 1426.68307 Theor. Comput. Sci. 771, 9-22 (2019). Reviewer: Vladimír Lacko (Košice) MSC: 68W25 68R10 PDFBibTeX XMLCite \textit{S. V. Ravelo} and \textit{C. E. Ferreira}, Theor. Comput. Sci. 771, 9--22 (2019; Zbl 1426.68307) Full Text: DOI
Bae, Sang Won; de Berg, Mark; Cheong, Otfried; Gudmundsson, Joachim; Levcopoulos, Christos Shortcuts for the circle. (English) Zbl 1457.68277 Comput. Geom. 79, 37-54 (2019). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{S. W. Bae} et al., Comput. Geom. 79, 37--54 (2019; Zbl 1457.68277) Full Text: DOI arXiv Link
Baswana, Surender; Choudhary, Keerti; Roditty, Liam An efficient strongly connected components algorithm in the fault tolerant model. (English) Zbl 1418.68159 Algorithmica 81, No. 3, 967-985 (2019). MSC: 68R10 68M15 PDFBibTeX XMLCite \textit{S. Baswana} et al., Algorithmica 81, No. 3, 967--985 (2019; Zbl 1418.68159) Full Text: DOI arXiv Link
Liu, Ziwen; Yang, Chao Hanano puzzle is NP-hard. (English) Zbl 1446.68070 Inf. Process. Lett. 145, 6-10 (2019). MSC: 68Q17 68R05 PDFBibTeX XMLCite \textit{Z. Liu} and \textit{C. Yang}, Inf. Process. Lett. 145, 6--10 (2019; Zbl 1446.68070) Full Text: DOI
Zych-Pawlewicz, Anna Reoptimization of NP-hard problems. (English) Zbl 1514.68318 Böckenhauer, Hans-Joachim (ed.) et al., Adventures between lower bounds and higher altitudes. Essays dedicated to Juraj Hromkovič on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 11011, 477-494 (2018). MSC: 68W25 68Q17 90C59 PDFBibTeX XMLCite \textit{A. Zych-Pawlewicz}, Lect. Notes Comput. Sci. 11011, 477--494 (2018; Zbl 1514.68318) Full Text: DOI
D’Andrea, Annalisa; Forlizzi, Luca; Proietti, Guido Stability of reapproximation algorithms for the \(\beta\)-metric traveling salesman (path) problem. (English) Zbl 1514.68313 Böckenhauer, Hans-Joachim (ed.) et al., Adventures between lower bounds and higher altitudes. Essays dedicated to Juraj Hromkovič on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 11011, 156-171 (2018). MSC: 68W25 05C22 05C38 05C45 90C27 90C35 90C59 PDFBibTeX XMLCite \textit{A. D'Andrea} et al., Lect. Notes Comput. Sci. 11011, 156--171 (2018; Zbl 1514.68313) Full Text: DOI
Bilò, Davide Almost optimal algorithms for diameter-optimally augmenting trees. (English) Zbl 1514.68200 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 40, 13 p. (2018). MSC: 68R10 05C12 05C85 68W40 PDFBibTeX XMLCite \textit{D. Bilò}, LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 40, 13 p. (2018; Zbl 1514.68200) Full Text: DOI
Bilò, Davide; Papadopoulos, Kleitos A novel algorithm for the all-best-swap-edge problem on tree spanners. (English) Zbl 07561361 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 7, 12 p. (2018). MSC: 68R10 68W40 PDFBibTeX XMLCite \textit{D. Bilò} and \textit{K. Papadopoulos}, LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 7, 12 p. (2018; Zbl 07561361) Full Text: DOI arXiv
Gupta, Manoj; Singh, Aditi Generic single edge fault tolerant exact distance oracle. (English) Zbl 1499.68274 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 72, 15 p. (2018). MSC: 68R10 68P05 68Q25 68W05 PDFBibTeX XMLCite \textit{M. Gupta} and \textit{A. Singh}, LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 72, 15 p. (2018; Zbl 1499.68274) Full Text: DOI arXiv
Bilò, Davide New algorithms for Steiner tree reoptimization. (English) Zbl 1499.68398 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 19, 14 p. (2018). MSC: 68W25 68W40 90C35 90C59 PDFBibTeX XMLCite \textit{D. Bilò}, LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 19, 14 p. (2018; Zbl 1499.68398) Full Text: DOI arXiv
Cazaux, Bastien; Rivals, Eric Superstrings with multiplicities. (English) Zbl 1497.68597 Navarro, Gonzalo (ed.) et al., 29th annual symposium on combinatorial pattern matching, CPM 2018, July 2–4, 2018, Qingdao, China. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 105, Article 21, 16 p. (2018). MSC: 68W32 68W25 PDFBibTeX XMLCite \textit{B. Cazaux} and \textit{E. Rivals}, LIPIcs -- Leibniz Int. Proc. Inform. 105, Article 21, 16 p. (2018; Zbl 1497.68597) Full Text: DOI
Chakraborty, Diptarka; Das, Debarati Sparse weight tolerant subgraph for single source shortest path. (English) Zbl 1477.05177 Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 15, 15 p. (2018). MSC: 05C85 05C38 PDFBibTeX XMLCite \textit{D. Chakraborty} and \textit{D. Das}, LIPIcs -- Leibniz Int. Proc. Inform. 101, Article 15, 15 p. (2018; Zbl 1477.05177) Full Text: DOI arXiv
Bilò, Davide; Lenzner, Pascal On the tree conjecture for the network creation game. (English) Zbl 1487.91017 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 14, 15 p. (2018). MSC: 91A43 91A68 05C90 PDFBibTeX XMLCite \textit{D. Bilò} and \textit{P. Lenzner}, LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 14, 15 p. (2018; Zbl 1487.91017) Full Text: DOI arXiv
Bilò, Davide; Choudhary, Keerti; Gualà, Luciano; Leucci, Stefano; Parter, Merav; Proietti, Guido Efficient oracles and routing schemes for replacement paths. (English) Zbl 1487.68051 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 13, 15 p. (2018). MSC: 68M15 68M10 68P05 68Q25 68R10 PDFBibTeX XMLCite \textit{D. Bilò} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 13, 15 p. (2018; Zbl 1487.68051) Full Text: DOI
Bergamini, Elisabetta; Crescenzi, Pierluigi; D’Angelo, Gianlorenzo; Meyerhenke, Henning; Severini, Lorenzo; Velaj, Yllka Improving the betweenness centrality of a node by adding links. (English) Zbl 1446.68111 ACM J. Exp. Algorithm. 23, No. 1, Article No. 1.5, 32 p. (2018). MSC: 68R10 68W25 PDFBibTeX XMLCite \textit{E. Bergamini} et al., ACM J. Exp. Algorithm. 23, No. 1, Article No. 1.5, 32 p. (2018; Zbl 1446.68111) Full Text: DOI arXiv
Wang, Haitao An improved algorithm for diameter-optimally augmenting paths in a metric space. (English) Zbl 1443.68209 Comput. Geom. 75, 11-21 (2018). MSC: 68U05 68R10 68W40 PDFBibTeX XMLCite \textit{H. Wang}, Comput. Geom. 75, 11--21 (2018; Zbl 1443.68209) Full Text: DOI arXiv
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido Fault-tolerant approximate shortest-path trees. (English) Zbl 1397.05045 Algorithmica 80, No. 12, 3437-3460 (2018). MSC: 05C12 05C05 05C38 68M15 68P05 68R10 PDFBibTeX XMLCite \textit{D. Bilò} et al., Algorithmica 80, No. 12, 3437--3460 (2018; Zbl 1397.05045) Full Text: DOI arXiv
Beaudou, Laurent; Dankelmann, Peter; Foucaud, Florent; Henning, Michael A.; Mary, Arnaud; Parreau, Aline Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension. (English) Zbl 1384.05077 SIAM J. Discrete Math. 32, No. 2, 902-918 (2018). MSC: 05C12 05C83 05C35 PDFBibTeX XMLCite \textit{L. Beaudou} et al., SIAM J. Discrete Math. 32, No. 2, 902--918 (2018; Zbl 1384.05077) Full Text: DOI arXiv
Buhmann, J. M.; Gronskiy, A. Y.; Mihalák, M.; Pröger, T.; Šrámek, R.; Widmayer, P. Robust optimization in the presence of uncertainty: a generic approach. (English) Zbl 1390.68589 J. Comput. Syst. Sci. 94, 135-166 (2018). MSC: 68T20 68T05 68T37 PDFBibTeX XMLCite \textit{J. M. Buhmann} et al., J. Comput. Syst. Sci. 94, 135--166 (2018; Zbl 1390.68589) Full Text: DOI
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
Garnero, Valentin; Junosza-Szaniawski, Konstanty; Liedloff, Mathieu; Montealegre, Pedro; Rzążewski, Paweł Fixing improper colorings of graphs. (English) Zbl 1386.68069 Theor. Comput. Sci. 711, 66-78 (2018). MSC: 68Q25 05C15 05C85 PDFBibTeX XMLCite \textit{V. Garnero} et al., Theor. Comput. Sci. 711, 66--78 (2018; Zbl 1386.68069) Full Text: DOI arXiv