×

Found 5,088 Documents (Results 1–100)

Algorithms and complexity of strongly stable non-crossing matchings. (English) Zbl 07728676

Bagchi, Amitabha (ed.) et al., Algorithms and discrete applied mathematics. 9th international conference, CALDAM 2023, Gandhinagar, India, February 9–11, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13947, 363-376 (2023).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Refined computational complexities of hospitals/residents problem with regional caps. (English) Zbl 07724757

Zhang, Yong (ed.) et al., Computing and combinatorics. 28th international conference, COCOON 2022, Shenzhen, China, October 22–24, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13595, 333-344 (2023).
MSC:  68Rxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

The complexity of growing a graph. (English) Zbl 07722896

Erlebach, Thomas (ed.) et al., Algorithmics of wireless networks. 18th international symposium on algorithmics of wireless networks, ALGOSENSORS 2022, Potsdam, Germany, September 8–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13707, 123-137 (2022).
MSC:  68M18 68T40
PDF BibTeX XML Cite
Full Text: DOI arXiv

Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines. (English) Zbl 07722424

Ljubić, Ivana (ed.) et al., Combinatorial optimization. 7th international symposium, ISCO 2022, virtual event, May 18–20, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13526, 324-335 (2022).
MSC:  90C27
PDF BibTeX XML Cite
Full Text: DOI

On the thinness of trees. (English) Zbl 07722414

Ljubić, Ivana (ed.) et al., Combinatorial optimization. 7th international symposium, ISCO 2022, virtual event, May 18–20, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13526, 189-200 (2022).
MSC:  90C27
PDF BibTeX XML Cite
Full Text: DOI

Finding low-weight polynomial multiples using the rho method. (English) Zbl 1515.94065

Batina, Lejla (ed.) et al., Progress in cryptology – AFRICACRYPT 2022. 13th international conference on cryptology in Africa, AFRICACRYPT 2022, Fes, Morocco, July 18–20, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13503, 550-575 (2022).
MSC:  94A60 11T06
PDF BibTeX XML Cite
Full Text: DOI

Hardness and approximation results for some variants of stable marriage problem. (English) Zbl 07683177

Balachandran, Niranjan (ed.) et al., Algorithms and discrete applied mathematics. 8th international conference, CALDAM 2022, Puducherry, India, February 10–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13179, 252-264 (2022).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Sufficient conditions for the significance of the coefficients of linear models and the polynomial-time complexity of their determination from data with interval uncertainty. (English. Russian original) Zbl 1511.15004

Autom. Remote Control 83, No. 12, 1886-1896 (2022); translation from Avtom. Telemekh. 2022, No. 12, 18-30 (2022).
MSC:  15A06 65F05
PDF BibTeX XML Cite
Full Text: DOI

On the stability of linear time-varying differential equations. (English. Russian original) Zbl 1517.34080

Proc. Steklov Inst. Math. 319, Suppl. 1, S298-S317 (2022); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 28, No. 3, 94-113 (2022).
MSC:  34D20 34A30 37C60
PDF BibTeX XML Cite
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

Main Field

all top 3

Software