×

Found 774 Documents (Results 1–100)

Optimal forks: preprocessing single-source shortest path instances with interval data. (English) Zbl 07896699

Müller-Hannemann, Matthias (ed.) et al., 21st symposium on algorithmic approaches for transportation modelling, optimization, and systems, ATMOS 2021, Lisbon, Portugal (virtual conference), September 9–10, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 96, Article 7, 15 p. (2021).
MSC:  90Cxx
Full Text: DOI

Interval edge coloring of bipartite graphs with small vertex degrees. (English) Zbl 07788599

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 26, 12 p. (2021).
MSC:  68Wxx
Full Text: DOI

Pspace-completeness of the temporal logic of sub-intervals and suffixes. (English) Zbl 07744952

Combi, Carlo (ed.) et al., 28th international symposium on temporal representation and reasoning. TIME 2021, Klagenfurt, Austria (virtual conference), September 27–29, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 206, Article 9, 19 p. (2021).
MSC:  68Q60 03B44
Full Text: DOI

Interval temporal random forests with an application to COVID-19 diagnosis. (English) Zbl 07744950

Combi, Carlo (ed.) et al., 28th international symposium on temporal representation and reasoning. TIME 2021, Klagenfurt, Austria (virtual conference), September 27–29, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 206, Article 7, 18 p. (2021).
MSC:  68T05
Full Text: DOI

Maximum cut on interval graphs of interval count four Is NP-complete. (English) Zbl 07724211

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 38, 15 p. (2021).
MSC:  68Qxx

Reconfiguring independent sets on interval graphs. (English) Zbl 07724196

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 23, 14 p. (2021).
MSC:  68Qxx

Interval reachability analysis. Bounding trajectories of uncertain systems with boxes for control and verification. (English) Zbl 1520.93003

SpringerBriefs in Electrical and Computer Engineering. Control, Automation and Robotics. Cham: Springer (ISBN 978-3-030-65109-1/pbk; 978-3-030-65110-7/ebook). x, 112 p. (2021).
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field

all top 3

Software