×

zbMATH — the first resource for mathematics

Found 798 Documents (Results 1–100)

Hits per Page
100
Display Format
MathJax
Result Sorting
Newest 1st
Sahai, Tuhin
Dynamical systems theory and algorithms for NP-hard problems. (English) Zbl 07271598
Junge, Oliver (ed.) et al., Advances in dynamics, optimization and computation. A volume dedicated to Michael Dellnitz on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-030-51263-7/hbk; 978-3-030-51264-4/ebook). Studies in Systems, Decision and Control 304, 183-206 (2020).
MSC:  68Q 68Q17 68Q25 65Y20 90C60 37N30
PDF BibTeX XML Cite
\textit{T. Sahai}, Stud. Syst. Decis. Control 304, 183--206 (2020; Zbl 07271598)
Full Text: DOI
Jana, Satyabrata; Maheshwari, Anil; Mehrabi, Saeed; Roy, Sasanka
Maximum bipartite subgraph of geometric intersection graphs. (English) Zbl 07224281
Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer (ISBN 978-3-030-39880-4/pbk; 978-3-030-39881-1/ebook). Lecture Notes in Computer Science 12049, 158-169 (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{S. Jana} et al., Lect. Notes Comput. Sci. 12049, 158--169 (2020; Zbl 07224281)
Full Text: DOI
Arroyo, Alan; Derka, Martin; Parada, Irene
Extending simple drawings. (English) Zbl 07266119
Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-35801-3/pbk; 978-3-030-35802-0/ebook). Lecture Notes in Computer Science 11904, 230-243 (2019).
MSC:  68R10 68U05
PDF BibTeX XML Cite
\textit{A. Arroyo} et al., Lect. Notes Comput. Sci. 11904, 230--243 (2019; Zbl 07266119)
Full Text: DOI
Aichholzer, Oswin; Korman, Matias; Okamoto, Yoshio; Parada, Irene; Perz, Daniel; van Renssen, André; Vogtenhuber, Birgit
Graphs with large total angular resolution. (English) Zbl 07266116
Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-35801-3/pbk; 978-3-030-35802-0/ebook). Lecture Notes in Computer Science 11904, 193-199 (2019).
MSC:  68R10 68U05
PDF BibTeX XML Cite
\textit{O. Aichholzer} et al., Lect. Notes Comput. Sci. 11904, 193--199 (2019; Zbl 07266116)
Full Text: DOI
Misra, Neeldhara; Sonar, Chinmay
Robustness radius for Chamberlin-Courant on restricted domains. (English) Zbl 1446.91041
Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 341-353 (2019).
MSC:  91B12 68Q17
PDF BibTeX XML Cite
\textit{N. Misra} and \textit{C. Sonar}, Lect. Notes Comput. Sci. 11376, 341--353 (2019; Zbl 1446.91041)
Full Text: DOI
Gupta, Manoj; Kumar, Hitesh; Misra, Neeldhara
On the complexity of optimal matching reconfiguration. (English) Zbl 1444.68142
Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 221-233 (2019).
MSC:  68R10 05C70 05C85 68Q17
PDF BibTeX XML Cite
\textit{M. Gupta} et al., Lect. Notes Comput. Sci. 11376, 221--233 (2019; Zbl 1444.68142)
Full Text: DOI
Eremeev, Anton V.; Kel’manov, Alexander V.; Kovalyov, Mikhail Y.; Pyatkin, Artem V.
Maximum diversity problem with squared Euclidean distance. (English) Zbl 1446.90160
Khachay, Michael (ed.) et al., Mathematical optimization theory and operations research. 18th international conference, MOTOR 2019, Ekaterinburg, Russia, July 8–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11548, 541-551 (2019).
MSC:  90C39 90C59 51M05 52C10
PDF BibTeX XML Cite
\textit{A. V. Eremeev} et al., Lect. Notes Comput. Sci. 11548, 541--551 (2019; Zbl 1446.90160)
Full Text: DOI
Mitchell, Joseph S. B.; Pandit, Supantha
New results on a family of geometric hitting set problems in the plane. (English) Zbl 1435.68350
Li, Yingshu (ed.) et al., Combinatorial optimization and applications. 13th international conference, COCOA 2019, Xiamen, China, December 13–15, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11949, 387-399 (2019).
MSC:  68U05 68Q17 68W25
PDF BibTeX XML Cite
\textit{J. S. B. Mitchell} and \textit{S. Pandit}, Lect. Notes Comput. Sci. 11949, 387--399 (2019; Zbl 1435.68350)
Full Text: DOI
Gao, Guichen; Ning, Li; Ting, Hing-Fung; Zhang, Yong; Zou, Yifei
Algorithmic pricing for the partial assignment. (English) Zbl 1443.91161
Li, Yingshu (ed.) et al., Combinatorial optimization and applications. 13th international conference, COCOA 2019, Xiamen, China, December 13–15, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11949, 210-222 (2019).
MSC:  91B24 91B26 91B15 68Q25
PDF BibTeX XML Cite
\textit{G. Gao} et al., Lect. Notes Comput. Sci. 11949, 210--222 (2019; Zbl 1443.91161)
Full Text: DOI
Bhore, Sujoy; Jana, Satyabrata; Pandit, Supantha; Roy, Sasanka
Balanced connected subgraph problem in geometric intersection graphs. (English) Zbl 1434.68347
Li, Yingshu (ed.) et al., Combinatorial optimization and applications. 13th international conference, COCOA 2019, Xiamen, China, December 13–15, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11949, 56-68 (2019).
MSC:  68R10 05C15 05C62 68Q17 68W40
PDF BibTeX XML Cite
\textit{S. Bhore} et al., Lect. Notes Comput. Sci. 11949, 56--68 (2019; Zbl 1434.68347)
Full Text: DOI
Disser, Yann; Feldmann, Andreas Emil; Klimm, Max; Könemann, Jochen
Travelling on graphs with small highway dimension. (English) Zbl 07173299
Sau, Ignasi (ed.) et al., Graph-theoretic concepts in computer science. 45th international workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019. Revised papers. Cham: Springer (ISBN 978-3-030-30785-1/pbk; 978-3-030-30786-8/ebook). Lecture Notes in Computer Science 11789, 175-189 (2019).
MSC:  68R10
PDF BibTeX XML Cite
\textit{Y. Disser} et al., Lect. Notes Comput. Sci. 11789, 175--189 (2019; Zbl 07173299)
Full Text: DOI
Dayal, Pratyush; Misra, Neeldhara
Deleting to structured trees. (English) Zbl 07172834
Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 25th international conference, COCOON 2019, Xi’an, China, July 29–31, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-26175-7/pbk; 978-3-030-26176-4/ebook). Lecture Notes in Computer Science 11653, 128-139 (2019).
MSC:  68Rxx
PDF BibTeX XML Cite
\textit{P. Dayal} and \textit{N. Misra}, Lect. Notes Comput. Sci. 11653, 128--139 (2019; Zbl 07172834)
Full Text: DOI
Chlebíková, Janka; Dallard, Clément; Paulsen, Niklas
Complexity of scheduling for DARP with soft ride times. (English) Zbl 07163783
Heggernes, Pinar (ed.), Algorithms and complexity. 11th international conference, CIAC 2019, Rome, Italy, May 27–29, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-17401-9/pbk; 978-3-030-17402-6/ebook). Lecture Notes in Computer Science 11485, 149-160 (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{J. Chlebíková} et al., Lect. Notes Comput. Sci. 11485, 149--160 (2019; Zbl 07163783)
Full Text: DOI
Kel’manov, A. V.; Panasenko, A. V.; Khandeev, V. I.
Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space. (English. Russian original) Zbl 1423.68597
Comput. Math. Math. Phys. 59, No. 5, 842-850 (2019); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 5, 895-904 (2019).
MSC:  68W25 68U05 68W20 68W40
PDF BibTeX XML Cite
\textit{A. V. Kel'manov} et al., Comput. Math. Math. Phys. 59, No. 5, 842--850 (2019; Zbl 1423.68597); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 5, 895--904 (2019)
Full Text: DOI
Jia, Yiyang; Kanamori, Yoshihiro; Mitani, Jun
Flat-foldability for \(1 \times n\) maps with square/diagonal grid patterns. (English) Zbl 07117321
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 (ISBN 978-3-030-10563-1/pbk; 978-3-030-10564-8/ebook). Lecture Notes in Computer Science 11355, 135-147 (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{Y. Jia} et al., Lect. Notes Comput. Sci. 11355, 135--147 (2019; Zbl 07117321)
Full Text: DOI
Bhore, Sujoy; Chakraborty, Sourav; Jana, Satyabrata; Mitchell, Joseph S. B.; Pandit, Supantha; Roy, Sasanka
The balanced connected subgraph problem. (English) Zbl 1436.68222
Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11394, 201-215 (2019).
MSC:  68R10 05C40 05C85 68Q17 68W40
PDF BibTeX XML Cite
\textit{S. Bhore} et al., Lect. Notes Comput. Sci. 11394, 201--215 (2019; Zbl 1436.68222)
Full Text: DOI arXiv
Matsumoto, Kosuke; Hatano, Kohei; Takimoto, Eiji
Decision diagrams for solving a job scheduling problem under precedence constraints. (English) Zbl 07286678
D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-070-5). LIPIcs – Leibniz International Proceedings in Informatics 103, Article 5, 12 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{K. Matsumoto} et al., LIPIcs -- Leibniz Int. Proc. Inform. 103, Article 5, 12 p. (2018; Zbl 07286678)
Full Text: DOI
Hirahara, Shuichi; Oliveira, Igor C.; Santhanam, Rahul
NP-hardness of minimum circuit size problem for OR-AND-MOD circuits. (English) Zbl 1441.68074
Servedio, Rocco A. (ed.), 33rd computational complexity conference, CCC 2018, June 22–24, 2018, San Diego, California, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 102, Article 5, 31 p. (2018).
MSC:  68Q17 68Q06
PDF BibTeX XML Cite
\textit{S. Hirahara} et al., LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 5, 31 p. (2018; Zbl 1441.68074)
Full Text: DOI
Demaine, Erik D.; Rudoy, Mikhail
Tree-residue vertex-breaking: a new tool for proving hardness. (English) Zbl 07238987
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 (ISBN 978-3-95977-068-2). LIPIcs – Leibniz International Proceedings in Informatics 101, Article 32, 14 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{E. D. Demaine} and \textit{M. Rudoy}, LIPIcs -- Leibniz Int. Proc. Inform. 101, Article 32, 14 p. (2018; Zbl 07238987)
Full Text: DOI
Demaine, Erik D.; Eisenstat, Sarah; Rudoy, Mikhail
Solving the Rubik’s cube optimally is NP-complete. (English) Zbl 07228415
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 (ISBN 978-3-95977-062-0). LIPIcs – Leibniz International Proceedings in Informatics 96, Article 24, 13 p. (2018).
MSC:  68Qxx
PDF BibTeX XML Cite
\textit{E. D. Demaine} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 24, 13 p. (2018; Zbl 07228415)
Full Text: DOI
Attiya, Hagit; Yavneh, Gili
Remote memory references at block granularity. (English) Zbl 07226028
Aspnes, James (ed.) et al., 21st international conference on principles of distributed systems, OPODIS 2017, Lisboa, Portugal, December 18–20, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-061-3). LIPIcs – Leibniz International Proceedings in Informatics 95, Article 18, 17 p. (2018).
MSC:  68M14 68M20
PDF BibTeX XML Cite
\textit{H. Attiya} and \textit{G. Yavneh}, LIPIcs -- Leibniz Int. Proc. Inform. 95, Article 18, 17 p. (2018; Zbl 07226028)
Full Text: DOI
Ahmed, Syed Ali; Farhat, Saman; Mneimneh, Saad
Making multiple RNA interaction practical. (English) Zbl 07116412
Kim, Donghyun (ed.) et al., Combinatorial optimization and applications. 12th international conference, COCOA 2018, Atlanta, GA, USA, December 15–17, 2018. Proceedings. Cham: Springer (ISBN 978-3-030-04650-7/pbk; 978-3-030-04651-4/ebook). Lecture Notes in Computer Science 11346, 651-671 (2018).
MSC:  68T20 90C27
PDF BibTeX XML Cite
\textit{S. A. Ahmed} et al., Lect. Notes Comput. Sci. 11346, 651--671 (2018; Zbl 07116412)
Full Text: DOI
Kel’manov, A. V.; Motkova, A. V.; Shenmaier, V. V.
Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster. (English. Russian original) Zbl 07072463
Proc. Steklov Inst. Math. 303, Suppl. 1, S136-S145 (2018); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 23, No. 3, 159-170 (2017).
MSC:  68 90
PDF BibTeX XML Cite
\textit{A. V. Kel'manov} et al., Proc. Steklov Inst. Math. 303, S136--S145 (2018; Zbl 07072463); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 23, No. 3, 159--170 (2017)
Full Text: DOI

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Serial
all top 5
Year of Publication
all top 3
Classification
Biographic Reference
all top 3
Software