×

Found 125 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

A fair-cost analysis of the random neighbor sampling method. (English) Zbl 1514.62030

Benito, Rosa Maria (ed.) et al., Complex networks & their applications X. Volume 1. Proceedings of the 10th international conference, COMPLEX NETWORKS 2021, Madrid, Spain, November 30 – December 2, 2021. Cham: Springer. Stud. Comput. Intell. 1015, 3-15 (2022).
MSC:  62D99 92B20 91B02
PDFBibTeX XMLCite
Full Text: DOI

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

Graph profile realizations and applications to social networks. (English) Zbl 1442.91075

Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11355, 3-14 (2019).
MSC:  91D30 05C90
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

Tight approximation bounds for the seminar assignment problem. (English) Zbl 1484.68327

Jansen, Klaus (ed.) et al., Approximation and online algorithms. 14th international workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10138, 170-182 (2017).
MSC:  68W25 90B80 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Improved approximation algorithms for weighted 2-path partitions. (English) Zbl 1466.05175

Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 953-964 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Algorithms for sensor systems. 8th international symposium on algorithms for sensor systems, wireless ad hoc networks and autonomous mobile entities, ALGOSENSORS 2012, Ljubljana, Slovenia, September 13–14, 2012. Revised selected papers. (English) Zbl 1322.68010

Lecture Notes in Computer Science 7718. Berlin: Springer (ISBN 978-3-642-36091-6/pbk). x, 145 p. (2013).
MSC:  68-06 68M10 00B25
PDFBibTeX XMLCite
Full Text: DOI

Maximizing barrier coverage lifetime with mobile sensors. (English) Zbl 1394.68009

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, 97-108 (2013).
MSC:  68M10 68Q17 68U05
PDFBibTeX XMLCite
Full Text: DOI

A competitive rate allocation game. (English) Zbl 1268.91031

Krishnamurthy, Vikram (ed.) et al., Game theory for networks. Third international ICST conference, GameNets 2012, Vancouver, Canada, May 24–26, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-35581-3/pbk; 978-3-642-35582-0/ebook). Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 105, 16-30 (2012).
MSC:  91A43 91B32
PDFBibTeX XMLCite
Full Text: DOI

Changing of the guards: strip cover with duty cycling. (English) Zbl 1332.68020

Even, Guy (ed.) et al., Structural information and communication complexity. 19th international colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30–July 2, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31103-1/pbk). Lecture Notes in Computer Science 7355, 36-47 (2012).
MSC:  68M20 68W25
PDFBibTeX XMLCite
Full Text: DOI Link

Finding mobile data under delay constraints with searching costs. (English) Zbl 1315.68285

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

Ordered coloring grids and related graphs. (English) Zbl 1274.68269

Kutten, Shay (ed.) et al., Structural information and communication complexity. 16th international colloquium, SIROCCO 2009, Piran, Slovenia, May 25–27, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11475-5/pbk). Lecture Notes in Computer Science 5869, 30-43 (2010).
MSC:  68R10 05C15
PDFBibTeX XMLCite
Full Text: DOI

Online maximum directed cut. (English) Zbl 1273.68415

Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16–18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 1124-1133 (2009).
MSC:  68W27 05C85 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Peak shaving through resource buffering. (English) Zbl 1209.68656

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, 147-159 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Finding mobile data: Efficiency vs. location inaccuracy. (English) Zbl 1151.68315

Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 111-122 (2007).
MSC:  68M10 91A43 91A46
PDFBibTeX XMLCite
Full Text: DOI

Online dynamic programming speedups. (English) Zbl 1129.90371

Erlebach, Thomas (ed.) et al., Approximation and online algorithms. 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14–15, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-69513-4/pbk). Lecture Notes in Computer Science 4368, 43-54 (2007).
MSC:  90C39 68W40 90-08
PDFBibTeX XMLCite
Full Text: DOI

Online conflict-free colorings for hypergraphs. (English) Zbl 1171.05422

Arge, Lars (ed.) et al., Automata, languages and programming. 34th international colloquium, ICALP 2007, Wrocław, Poland, July 9–13, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73419-2/pbk). Lecture Notes in Computer Science 4596, 219-230 (2007).
PDFBibTeX XMLCite
Full Text: DOI

A general buffer scheme for the windows scheduling problem. (English) Zbl 1121.90310

Nikoletseas, Sotiris E. (ed.), Experimental and efficient algorithms. 4th international workshop, WEA 2005, Santorini Island, Greece, May 10–13, 2005. Proceedings. Berlin Springer (ISBN 3-540-25920-1/pbk). Lecture Notes in Computer Science 3503, 139-151 (2005).
MSC:  90B18 90B35 68U35
PDFBibTeX XMLCite
Full Text: DOI

Competitive on-line paging strategies for mobile users under delay constraints. (English) Zbl 1321.68511

Proceedings of the 23rd annual ACM symposium on principles of distributed computing, PODC ’04, St. Johns, Newfoundland, Canada, July 25–28, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-802-4). 256-265 (2004).
PDFBibTeX XMLCite
Full Text: DOI

Windows scheduling as a restricted version of bin packing. (English) Zbl 1317.68290

Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 224-233 (2004).
PDFBibTeX XMLCite

Scheduling techniques for media-on-demand. (English) Zbl 1092.68541

Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, USA, January 12–14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics (ISBN 0-89871-538-5/pbk). 791-800 (2003).
MSC:  68M20 68M10
PDFBibTeX XMLCite

Establishing wireless conference calls under delay constraints. (English) Zbl 1292.90074

Proceedings of the 21st annual ACM symposium on principles of distributed computing, PODC ’02, Monterey, CA, USA, July 21–24, 2002. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-485-1). 41-50 (2002).
MSC:  90B18 68Q17 68W25
PDFBibTeX XMLCite
Full Text: DOI

Throughput maximization of real-time scheduling with batching. (English) Zbl 1093.68547

Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 742-751 (2002).
MSC:  68M20
PDFBibTeX XMLCite

Competitive on-line switching policies. (English) Zbl 1058.94533

Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 525-534 (2002).
MSC:  94C10 90B18 68M10
PDFBibTeX XMLCite

Windows scheduling problems for broadcast systems. (English) Zbl 1058.94500

Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 433-442 (2002).
MSC:  94A05 90B35 68M20
PDFBibTeX XMLCite

Nearly optimal perfectly-periodic schedules. (English) Zbl 1333.90057

Proceedings of the 20th annual ACM symposium on principles of distributed computing, PODC ’01, Newport, RI, USA, August 26–28, 2001. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-383-9). 107-116 (2001).
MSC:  90B36 68M20 68W15
PDFBibTeX XMLCite
Full Text: DOI

Competitive on-line stream merging algorithms for media-on-demand. (Extended abstract). (English) Zbl 0987.68088

Kosaraju, Deborah, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. Washington, DC, USA, January 7-9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. 364-373 (2001).
MSC:  68W05
PDFBibTeX XMLCite

A unified approach to approximating resource allocation and scheduling. (English) Zbl 1296.68023

Proceedings of the thirty-second annual ACM symposium on theory of computing (STOC 2000), Portland, Oregon, USA, May 21–23, 2000. New York, NY: ACM Press (ISBN 1-58113-184-4). 735-744 (2000).
MSC:  68M20 68W25
PDFBibTeX XMLCite
Full Text: DOI

Approximating the throughput of multiple machines under real-time scheduling. (English) Zbl 1345.68026

Vitter, Jeffrey Scott (ed.) et al., Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1–4, 1999. New York, NY: ACM, Association for Computing Machinery (ISBN 1-58113-067-8). 622-631 (1999).
MSC:  68M20 68W25
PDFBibTeX XMLCite
Full Text: DOI

Competitive dynamic bandwidth allocation. (English) Zbl 1333.68025

Proceedings of the 17th annual ACM symposium on principles of distributed computing, PODC ’98, Puerto Vallarta, Mexico, June 28 – July 2, 1998. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-977-7). 31-39 (1998).
MSC:  68M10 68M14 68W15
PDFBibTeX XMLCite
Full Text: DOI

Multicasting in heterogeneous networks. (English) Zbl 1028.68013

STOC ’98. Proceedings of the 30th annual ACM symposium on theory of computing, Dallas, TX, USA, May 23-26, 1998. New York, NY: ACM, Association for Computing Machinery. 448-453 (1998).
MSC:  68M10
PDFBibTeX XMLCite

Minimizing service and operation costs of periodic scheduling. (English) Zbl 0929.68011

Proceedings of the 9th annual ACM-SIAM symposium on Discrete algorithms. San Francisco, CA, USA, January 25–27, 1998. Philadelphia, PA: SIAM. 11-20 (1998).
MSC:  68M20
PDFBibTeX XMLCite

The minimum color sum of bipartite graphs. (English) Zbl 1401.68242

Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 738-748 (1997).
PDFBibTeX XMLCite
Full Text: DOI

Guaranteeing fair service to persistent dependent tasks. (English) Zbl 0847.90077

Clarkson, K. (ed.), Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 22-24, 1995. Philadelphia, PA: SIAM. 243-252 (1995).
MSC:  90B35
PDFBibTeX XMLCite

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software