×

Found 158 Documents (Results 1–100)

Degree realization by bipartite multigraphs. (English) Zbl 07786512

Rajsbaum, Sergio (ed.) et al., Structural information and communication complexity. 30th international colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6–9, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13892, 3-17 (2023).
MSC:  68Mxx 68Q11 68R10
PDFBibTeX XMLCite
Full Text: DOI

48th international symposium on mathematical foundations of computer science, MFCS 2023, Bordeaux, France, August 28 – September 1, 2023. (English) Zbl 1520.68007

LIPIcs – Leibniz International Proceedings in Informatics 272. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik (ISBN 978-3-95977-292-1). xvii, 88 p., open access (2023).
MSC:  68-06 68Qxx 00B25
PDFBibTeX XMLCite
Full Text: DOI Link

Vertex-weighted graphs: realizable and unrealizable domains. (English) Zbl 07556581

Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 315-327 (2022).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Selected neighbor degree forest realization. (English) Zbl 07788600

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 27, 15 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Weighted microscopic image reconstruction. (English) Zbl 1490.68270

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 373-386 (2021).
MSC:  68U10 05C50 68R10
PDFBibTeX XMLCite
Full Text: DOI

Graph realizations: maximum degree in vertex neighborhoods. (English) Zbl 07759278

Albers, Susanne (ed.), 17th Scandinavian symposium and workshops on algorithm theory, SWAT 2020, Tórshavn, Faroe Islands, June 22–24, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 162, Article 10, 17 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Minimum neighboring degree realization in graphs and trees. (English) Zbl 07651149

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 10, 15 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Efficiently realizing interval sequences. (English) Zbl 07650280

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 47, 15 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

The generalized microscopic image reconstruction problem. (English) Zbl 1527.68252

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 42, 15 p. (2019).
MSC:  68U10 68R10
PDFBibTeX XMLCite
Full Text: DOI

Mixed fault tolerance in server assignment: combining reinforcement and backup. (English) Zbl 1517.68063

Lotker, Zvi (ed.) et al., Structural information and communication complexity. 25th international colloquium, SIROCCO 2018, Ma’ale HaHamisha, Israel, June 18–21, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11085, 249-263 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Realizability of graph specifications: characterizations and algorithms. (English) Zbl 1517.68271

Lotker, Zvi (ed.) et al., Structural information and communication complexity. 25th international colloquium, SIROCCO 2018, Ma’ale HaHamisha, Israel, June 18–21, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11085, 3-13 (2018).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI

Dynamic \((1 + \epsilon)\)-approximate matchings: a density-sensitive approach. (English) Zbl 1410.68305

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 712-729 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Homophily and the glass ceiling effect in social networks. (English) Zbl 1366.91119

Proceedings of the 6th conference on innovations in theoretical computer science, ITCS’15, Rehovot, Israel, January 11–13, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3333-7). 41-50 (2015).
MSC:  91D30 68R10
PDFBibTeX XMLCite
Full Text: DOI

Nearly optimal local broadcasting in the SINR model with feedback. (English) Zbl 1476.68016

Scheideler, Christian (ed.), Structural information and communication complexity. 22nd international colloquium, SIROCCO 2015, Montserrat, Spain, July 14–16, 2015. Post-proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9439, 164-178 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Fault tolerant approximate BFS structures. (English) Zbl 1422.68194

Chekuri, Chandra (ed.), Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5–7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1073-1092 (2014).
MSC:  68R10 68P05 68M15
PDFBibTeX XMLCite
Full Text: DOI

Efficient distributed source detection with limited bandwidth. (English) Zbl 1323.68421

Proceedings of the 2013 ACM symposium on principles of distributed computing, PODC ’13, Montreal, QC, Canada, July 22–24, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2065-8). 375-382 (2013).
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of universal leader election. (English) Zbl 1323.68559

Proceedings of the 2013 ACM symposium on principles of distributed computing, PODC ’13, Montreal, QC, Canada, July 22–24, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2065-8). 100-109 (2013).
PDFBibTeX XMLCite
Full Text: DOI Link

Sparse fault-tolerant BFS trees. (English) Zbl 1376.68113

Bodlaender, Hans L. (ed.) et al., Algorithms – ESA 2013. 21st annual European symposium, Sophia Antipolis, France, September 2–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40449-8/pbk). Lecture Notes in Computer Science 8125, 779-790 (2013).
MSC:  68R10 05C85 68M15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Secluded connectivity problems. (English) Zbl 1380.68308

Bodlaender, Hans L. (ed.) et al., Algorithms – ESA 2013. 21st annual European symposium, Sophia Antipolis, France, September 2–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40449-8/pbk). Lecture Notes in Computer Science 8125, 301-312 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part I. (English) Zbl 1268.68018

Lecture Notes in Computer Science 7965. Berlin: Springer (ISBN 978-3-642-39205-4/pbk). xxv, 854 p. (2013).
PDFBibTeX XMLCite
Full Text: DOI

Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part II. (English) Zbl 1268.68017

Lecture Notes in Computer Science 7966. Berlin: Springer (ISBN 978-3-642-39211-5/pbk). xxvi, 698 p. (2013).
PDFBibTeX XMLCite
Full Text: DOI

Gathering despite mischief. (English) Zbl 1421.68119

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 527-540 (2012).
PDFBibTeX XMLCite
Full Text: Link

SINR diagram with interference cancellation. (English) Zbl 1422.68179

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 502-515 (2012).
PDFBibTeX XMLCite
Full Text: arXiv Link

Multipath spanners via fault-tolerant spanners. (English) Zbl 1385.68025

Even, Guy (ed.) et al., Design and analysis of algorithms. First Mediterranean conference on algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3–5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-34861-7/pbk). Lecture Notes in Computer Science 7659, 108-119 (2012).
MSC:  68R10 05C85
PDFBibTeX XMLCite
Full Text: DOI

Distributed algorithms for network diameter and girth. (English) Zbl 1343.68283

Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 660-672 (2012).
MSC:  68W15 68R10 68W25
PDFBibTeX XMLCite
Full Text: DOI

Distributed verification and hardness of distributed approximation. (English) Zbl 1288.68110

Proceedings of the 43rd annual ACM symposium on theory of computing, STOC ’11. San Jose, CA, USA, June 6–8, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0691-1). 363-372 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Tight bounds for distributed MST verification. (English) Zbl 1230.68143

Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10–12, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPIcs – Leibniz International Proceedings in Informatics 9, 69-80, electronic only (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Distributed computing. 25th international symposium, DISC 2011, Rome, Italy, September 20–22, 2011. Proceedings. (English) Zbl 1225.68024

Lecture Notes in Computer Science 6950. Berlin: Springer (ISBN 978-3-642-24099-7/pbk). xvii, 506 p. (2011).
PDFBibTeX XMLCite
Full Text: DOI

Forbidden-set distance labels for graphs of bounded doubling dimension. (English) Zbl 1315.68196

Proceedings of the 29th annual ACM SIGACT-SIGOPS symposium on principles of distributed computing, PODC ’10, Zurich, Switzerland, July 25–28, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-888-9). 192-200 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Relaxed spanners for directed disk graphs. (English) Zbl 1230.68160

Marion, Jean-Yves (ed.) et al., STACS 2010. 27th international symposium on theoretical aspects of computer science, Nancy, France, March 4–6, 2010. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-16-3). LIPIcs – Leibniz International Proceedings in Informatics 5, 609-620, electronic only (2010).
MSC:  68R10 68W40 68U05
PDFBibTeX XMLCite
Full Text: DOI Link

Robust fault tolerant uncapacitated facility location. (English) Zbl 1230.68213

Marion, Jean-Yves (ed.) et al., STACS 2010. 27th international symposium on theoretical aspects of computer science, Nancy, France, March 4–6, 2010. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-16-3). LIPIcs – Leibniz International Proceedings in Informatics 5, 191-202, electronic only (2010).
PDFBibTeX XMLCite
Full Text: DOI Link

Sparse reliable graph backbones. (English) Zbl 1288.68030

Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-14161-4/pbk). Lecture Notes in Computer Science 6199, 261-272 (2010).
MSC:  68M15 68R10
PDFBibTeX XMLCite
Full Text: DOI Link

\(f\)-sensitivity distance oracles and routing schemes. (English) Zbl 1287.68027

de Berg, Mark (ed.) et al., Algorithms – ESA 2010. 18th annual European symposium, Liverpool, UK, September 6–8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 84-96 (2010).
MSC:  68P05 68R10
PDFBibTeX XMLCite
Full Text: DOI

Low-port tree representations. (English) Zbl 1273.68274

Paul, Christophe (ed.) et al., Graph-theoretic concepts in computer science. 35th international workshop, WG 2009, Montpellier, France, June 24–26, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11408-3/pbk). Lecture Notes in Computer Science 5911, 66-76 (2010).
PDFBibTeX XMLCite
Full Text: DOI

SOFSEM 2010: Theory and practice of computer science. 36th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 23–29, 2010. Proceedings. (English) Zbl 1180.68007

Lecture Notes in Computer Science 5901. Berlin: Springer (ISBN 978-3-642-11265-2/pbk). xv, 780 p. (2010).
MSC:  68-06 68Qxx 00B25
PDFBibTeX XMLCite
Full Text: DOI

Fault-tolerant spanners for general graphs. (English) Zbl 1304.68138

Proceedings of the 41st annual ACM symposium on theory of computing, STOC ’09. Bethesda, MD, USA, May 31 – June 2, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-613-7). 435-444 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Efficient \(k\)-shot broadcasting in radio networks. (English) Zbl 1261.68007

Keidar, Idit (ed.), Distributed computing. 23rd international symposium, DISC 2009, Elche, Spain, September 23–25, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04354-3/pbk). Lecture Notes in Computer Science 5805, 481-495 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Degree-constrained subgraph problems: Hardness and approximation results. (English) Zbl 1209.68629

Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18–19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-93979-5/pbk). Lecture Notes in Computer Science 5426, 29-42 (2009).
PDFBibTeX XMLCite
Full Text: DOI Link

On the effect of the deployment setting on broadcasting in Euclidean radio networks. (English) Zbl 1301.68144

Proceedings of the 27th annual ACM symposium on principles of distributed computing, PODC ’08, Toronto, Canada, August 18–21, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-989-0). 223-232 (2008).
PDFBibTeX XMLCite
Full Text: DOI

A near-linear time algorithm for computing replacement paths in planar directed graphs. (English) Zbl 1192.68822

Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 428-435 (2008).
PDFBibTeX XMLCite

Compact separator decompositions in dynamic trees and applications to labeling schemes. (English) Zbl 1145.68592

Pelc, Andrzej (ed.), Distributed computing. 21st international symposium, DISC 2007, Lemesos, Cyprus, September 24–26, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-75141-0/pbk). Lecture Notes in Computer Science 4731, 313-327 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Energy and time efficient broadcasting in known topology radio networks. (English) Zbl 1145.68326

Pelc, Andrzej (ed.), Distributed computing. 21st international symposium, DISC 2007, Lemesos, Cyprus, September 24–26, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-75141-0/pbk). Lecture Notes in Computer Science 4731, 253-267 (2007).
MSC:  68M10 68M12 68R10
PDFBibTeX XMLCite
Full Text: DOI

Deterministic distributed construction of linear stretch spanners in polylogarithmic time. (English) Zbl 1145.68588

Pelc, Andrzej (ed.), Distributed computing. 21st international symposium, DISC 2007, Lemesos, Cyprus, September 24–26, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-75141-0/pbk). Lecture Notes in Computer Science 4731, 179-192 (2007).
PDFBibTeX XMLCite
Full Text: DOI

A tight upper bound on the probabilistic embedding of series-parallel graphs. (English) Zbl 1192.05156

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 1045-1053 (2006).
MSC:  05C85 68R10 05C10
PDFBibTeX XMLCite
Full Text: DOI

Dynamic routing schemes for general graphs. (English) Zbl 1223.68084

Bugliesi, Michele (ed.) et al., Automata, languages and programming. 33rd international colloquium, ICALP 2006, Venice, Italy, July 10–14, 2006. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-35904-3/pbk). Lecture Notes in Computer Science 4051, 619-630 (2006).
MSC:  68R10 05C85 68M10
PDFBibTeX XMLCite
Full Text: DOI

Constructing labeling schemes through universal matrices. (English) Zbl 1135.68521

Asano, Tetsuo (ed.), Algorithms and computation. 17th international symposium, ISAAC 2006, Kolkata, India, December 18–20, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-49694-6/pbk). Lecture Notes in Computer Science 4288, 409-418 (2006).
MSC:  68R10 05C78 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Feasibility and complexity of broadcasting with random transmission failures. (English) Zbl 1314.68080

Proceedings of the 24th annual ACM symposium on principles of distributed computing, PODC ’05, Las Vegas, NV, USA, July 17–20, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-994-2). 334-341 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Faster communication in known topology radio networks. (English) Zbl 1314.68155

Proceedings of the 24th annual ACM symposium on principles of distributed computing, PODC ’05, Las Vegas, NV, USA, July 17–20, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-994-2). 129-137 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Proof labeling schemes. (English) Zbl 1314.68066

Proceedings of the 24th annual ACM symposium on principles of distributed computing, PODC ’05, Las Vegas, NV, USA, July 17–20, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-994-2). 9-18 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Label-guided graph exploration by a finite automaton. (English) Zbl 1082.68588

Caires, Luís (ed.) et al., Automata, languages and programming. 32nd international colloquium, ICALP 2005, Lisbon, Portugal, July 11–15, 2005. Proceedings. Berlin: Springer (ISBN 3-540-27580-0/pbk). Lecture Notes in Computer Science 3580, 335-346 (2005).
MSC:  68R10 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Graph exploration by a finite automaton. (English) Zbl 1096.68080

Fiala, Jiří(ed.) et al., Mathematical foundations of computer Science 2004. 29th international symposium, MFCS 2004, Prague, Czech Republic, August 22–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22823-3/pbk). Lecture Notes in Computer Science 3153, 451-462 (2004).
MSC:  68Q45 05C85 68R10
PDFBibTeX XMLCite
Full Text: DOI

Labeling schemes for weighted dynamic trees. (English) Zbl 1039.68513

Baeten, Jos C. M. (ed.) et al., Automata, languages and programming. 30th international colloquium, ICALP 2003, Eindhoven, The Netherland, June 30 – July 4, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40493-7/pbk). Lect. Notes Comput. Sci. 2719, 369-383 (2003).
MSC:  68M10 68M12 68R10
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software