×

Found 161 Documents (Results 1–100)

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI

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
Full Text: DOI arXiv

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
Full Text: DOI

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI Link

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
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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
Full Text: DOI

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field