Zobrazeno 1 - 10
of 519
pro vyhledávání: '"Fomin, FV"'
Autor:
Fomin FV; University of Bergen, Bergen, Norway., Golovach PA; University of Bergen, Bergen, Norway., Inamdar T; Indian Institute of Technology, Jodhpur, Jodhpur, India., Saurabh S; University of Bergen, Bergen, Norway.; Institute of Mathematical Sciences, Chennai, India., Zehavi M; Ben-Guiron University, Beer-Sheva, Israel.
Publikováno v:
Discrete & computational geometry [Discrete Comput Geom] 2024; Vol. 72 (4), pp. 1596-1629. Date of Electronic Publication: 2024 Mar 12.
Autor:
Fomin FV; University of Bergen, Bergen, Norway., Golovach PA; University of Bergen, Bergen, Norway., Panolan F; IIT Hyderabad, Kandi, India., Philip G; Chennai Mathematical Institute, Chennai, India.; UMI ReLaX, Chennai, India., Saurabh S; University of Bergen, Bergen, Norway.; Institute of Mathematical Sciences, Chennai, India.
Publikováno v:
Mathematical programming [Math Program] 2024; Vol. 204 (1-2), pp. 415-447. Date of Electronic Publication: 2023 Apr 15.
Autor:
Fomin FV; Department of Informatics, University of Bergen, PB 7803, 5020 Bergen, Norway., Golovach PA; Department of Informatics, University of Bergen, PB 7803, 5020 Bergen, Norway., Lochet W; Department of Informatics, University of Bergen, PB 7803, 5020 Bergen, Norway., Misra P; Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbrücken, Germany., Saurabh S; Department of Informatics, University of Bergen, PB 7803, 5020 Bergen, Norway.; Institute of Mathematical Sciences, HBNI, Chennai, India., Sharma R; Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbrücken, Germany.
Publikováno v:
Algorithmica [Algorithmica] 2022; Vol. 84 (8), pp. 2292-2308. Date of Electronic Publication: 2021 Dec 27.
Autor:
Cunha, Luís1 (AUTHOR) lfignacio@ic.uff.br, Sau, Ignasi2 (AUTHOR) ignasi.sau@lirmm.fr, Souza, Uéverton1,3 (AUTHOR) ueverton@ic.uff.br
Publikováno v:
Algorithms for Molecular Biology. 12/24/2024, Vol. 19 Issue 1, p1-18. 18p.
Publikováno v:
ICALP (2). 7966(PART 2)
We study the problem of answering a union of Boolean conjunctive queries q against a database Δ, and a logical theory φ which falls in the guarded fragment with transitive guards (GF + TG). We trace the frontier between decidability and undecidabil
Autor:
Jaffke, Lars1 (AUTHOR) lars.jaffke@uib.no, Lima, Paloma T.2 (AUTHOR), Lokshtanov, Daniel3 (AUTHOR)
Publikováno v:
Theory of Computing Systems. Aug2024, Vol. 68 Issue 4, p1049-1081. 33p.
Autor:
Harutyunyan, Ararat1 (AUTHOR) ararat.harutyunyan@dauphine.fr, Lampis, Michael1 (AUTHOR), Melissinos, Nikolaos1 (AUTHOR)
Publikováno v:
Theory of Computing Systems. Aug2024, Vol. 68 Issue 4, p986-1013. 28p.
Autor:
Brewster, David A.1 (AUTHOR), Nowak, Martin A.2,3 (AUTHOR), Tkadlec, Josef2,4 (AUTHOR) josef.tkadlec@iuuk.mff.cuni.cz
Publikováno v:
PLoS Computational Biology. 7/18/2024, Vol. 20 Issue 7, p1-15. 15p.
Autor:
Yao, Hua-Ting1,2,3 (AUTHOR) htyao@tbi.univie.ac.at, Marchand, Bertrand1 (AUTHOR), Berkemer, Sarah J.1,4 (AUTHOR), Ponty, Yann1 (AUTHOR), Will, Sebastian1 (AUTHOR) sebastian.will@polytechnique.edu
Publikováno v:
Algorithms for Molecular Biology. 3/16/2024, Vol. 19 Issue 1, p1-29. 29p.