×

Found 11 Documents (Results 1–11)

Polynomial-time algorithm for sliding tokens on trees. (English) Zbl 1435.05189

Ahn, Hee-Kap (ed.) et al., Algorithms and computation. 25th international symposium, ISAAC 2014, Jeonju, Korea, December 15–17, 2014. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8889, 389-400 (2014).
MSC:  05C85 05C05
PDFBibTeX XMLCite
Full Text: DOI Link

Approximability of the subset sum reconfiguration problem. (English) Zbl 1330.68094

Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 58-69 (2011).
MSC:  68Q17 90C27 90C60
PDFBibTeX XMLCite
Full Text: DOI

Reconfiguration of list edge-colorings in a graph. (English) Zbl 1253.68263

Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 375-386 (2009).
MSC:  68R10 05C15 05C85
PDFBibTeX XMLCite
Full Text: DOI Link

On the complexity of reconfiguration problems. (English) Zbl 1183.68310

Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 28-39 (2008).
MSC:  68Q25 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Approximability of partitioning graphs with supply and demand. Extended abstract. (English) Zbl 1135.90423

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, 121-130 (2006).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field