×

Found 1,453 Documents (Results 1–100)

Minimizing the total weighted duration of courses in a single machine problem with precedence constraints. (English. Russian original) Zbl 07786736

Autom. Remote Control 84, No. 9, 1005-1015 (2023); translation from Avtom. Telemekh. 2023, No. 9, 153-168 (2023).
MSC:  90B35
PDFBibTeX XMLCite
Full Text: DOI

Improved and generalized algorithms for burning a planar point set. (English) Zbl 07770284

Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 90-101 (2023).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Complexity results on untangling red-blue matchings. (English) Zbl 07719377

Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 730-745 (2022).
MSC:  68Qxx 68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Finding geometric representations of apex graphs is NP-hard. (English) Zbl 07556569

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, 161-174 (2022).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Hardness of metric dimension in graphs of constant treewidth. (English) Zbl 07803602

Golovach, Petr A. (ed.) et al., 16th international symposium on parameterized and exact computation, IPEC 2021, Lisbon, Portugal, September 8–10, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 214, Article 24, 13 p. (2021).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Temporal reachability minimization: delaying vs. deleting. (English) Zbl 07724249

Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 76, 15 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Budgeted dominating sets in uncertain graphs. (English) Zbl 07724205

Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 32, 22 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Bottleneck convex subsets: finding \(k\) large convex sets in a point set. (English) Zbl 07670463

Chen, Chi-Yeh (ed.) et al., Computing and combinatorics. 27th international conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13025, 203-214 (2021).
MSC:  68Rxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Single machine scheduling with rejection to minimize the weighted makespan. (English) Zbl 1498.90092

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 96-110 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints. (English) Zbl 07550518

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 111-124 (2021).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

On the geometric red-blue set cover problem. (English) Zbl 07405957

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, 129-141 (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines. (English. Russian original) Zbl 1470.90040

Proc. Steklov Inst. Math. 313, Suppl. 1, S58-S72 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108-124 (2020).
PDFBibTeX XMLCite
Full Text: DOI

Finding temporal paths under waiting time constraints. (English) Zbl 07765388

Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 30, 18 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Parameterized complexity of geodetic set. (English) Zbl 07764111

Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 20, 14 p. (2020).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Designing art galleries (Media Exposition). (English) Zbl 07760209

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 80, 5 p. (2020).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Dots&polygons (Media Exposition). (English) Zbl 07760208

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 79, 4 p. (2020).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

String factorizations under various collision constraints. (English) Zbl 07651108

Gørtz, Inge Li (ed.) et al., 31st annual symposium on combinatorial pattern matching, CPM 2020, Copenhagen, Denmark, June 17–19, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 161, Article 17, 14 p. (2020).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI

Strong cliques in diamond-free graphs. (English) Zbl 07636211

Adler, Isolde (ed.) et al., Graph-theoretic concepts in computer science. 46th international workshop, WG 2020, Leeds, UK, June 24–26, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12301, 261-273 (2020).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI

Complexity of computing the anti-Ramsey numbers for paths. (English) Zbl 07559377

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 6, 14 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

On PTAS for the geometric maximum connected \(k\)-factor problem. (English) Zbl 1477.90083

Jaćimović, Milojica (ed.) et al., Optimization and applications. 10th international conference, OPTIMA 2019, Petrovac, Montenegro, September 30 – October 4, 2019. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1145, 194-205 (2020).
MSC:  90C27 90C35
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software