Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. (English) Zbl 07713421 Inf. Comput. 293, Article ID 105049, 21 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Inf. Comput. 293, Article ID 105049, 21 p. (2023; Zbl 07713421) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Parameterized complexity of elimination distance to first-order logic properties. (English) Zbl 1505.03075 ACM Trans. Comput. Log. 23, No. 3, Article No. 17, 35 p. (2022). MSC: 03B70 03B10 68Q19 68Q27 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., ACM Trans. Comput. Log. 23, No. 3, Article No. 17, 35 p. (2022; Zbl 1505.03075) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. (English) Zbl 07538586 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 308-320 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Lect. Notes Comput. Sci. 12911, 308--320 (2021; Zbl 07538586) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Sau, Ignasi; Stamoulis, Giannos; Thilikos, Dimitrios M. Compound Logics for Modification Problems. arXiv:2111.02755 Preprint, arXiv:2111.02755 [cs.DS] (2021). MSC: 05C83 05C85 68R10 68Q19 68Q27 68Q25 BibTeX Cite \textit{F. V. Fomin} et al., ``Compound Logics for Modification Problems'', Preprint, arXiv:2111.02755 [cs.DS] (2021) Full Text: arXiv OA License
Fomin, Fedor V.; Golovach, Petr A.; Stamoulis, Giannos; Thilikos, Dimitrios M. An algorithmic meta-theorem for graph modification to planarity and FOL. (English) Zbl 07651190 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 51, 17 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 51, 17 p. (2020; Zbl 07651190) Full Text: DOI arXiv
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Bidimensionality and kernels. (English) Zbl 1475.05161 SIAM J. Comput. 49, No. 6, 1397-1422 (2020). Reviewer: Steve Noble (London) MSC: 05C85 05C10 68R10 05C83 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Comput. 49, No. 6, 1397--1422 (2020; Zbl 1475.05161) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Strømme, Torstein J. F.; Thilikos, Dimitrios M. Subgraph complementation. (English) Zbl 1439.05212 Algorithmica 82, No. 7, 1859-1880 (2020). MSC: 05C85 05C75 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 82, No. 7, 1859--1880 (2020; Zbl 1439.05212) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. On the parameterized complexity of graph modification to first-order logic properties. (English) Zbl 1434.68208 Theory Comput. Syst. 64, No. 2, 251-271 (2020). MSC: 68Q27 68Q19 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Theory Comput. Syst. 64, No. 2, 251--271 (2020; Zbl 1434.68208) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Modification to planarity is fixed parameter tractable. (English) Zbl 07559137 Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 28, 17 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 126, Article 28, 17 p. (2019; Zbl 07559137) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Strømme, Torstein J. F.; Thilikos, Dimitrios M. Partial complementation of graphs. (English) Zbl 1477.68225 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. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 21, 13 p. (2018). MSC: 68R10 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 101, Article 21, 13 p. (2018; Zbl 1477.68225) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Structured connectivity augmentation. (English) Zbl 1400.05134 SIAM J. Discrete Math. 32, No. 4, 2612-2635 (2018). MSC: 05C40 05C85 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 32, No. 4, 2612--2635 (2018; Zbl 1400.05134) Full Text: DOI arXiv
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Kernels for (connected) dominating set on graphs with excluded topological minors. (English) Zbl 1455.68072 ACM Trans. Algorithms 14, No. 1, Article No. 6, 31 p. (2018). MSC: 68Q27 05C10 05C69 68Q17 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., ACM Trans. Algorithms 14, No. 1, Article No. 6, 31 p. (2018; Zbl 1455.68072) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Structured connectivity augmentation. (English) Zbl 1441.05125 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 29, 13 p. (2017). MSC: 05C40 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 29, 13 p. (2017; Zbl 1441.05125) Full Text: DOI
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M. (Meta) kernelization. (English) Zbl 1425.68137 J. ACM 63, No. 5, Article No. 44, 69 p. (2016). MSC: 68Q25 03B15 03B70 05C10 68R10 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., J. ACM 63, No. 5, Article No. 44, 69 p. (2016; Zbl 1425.68137) Full Text: DOI Link
Fomin, Fedor V. (ed.); Fraigniaud, Pierre (ed.); Nisse, Nicolas (ed.); Thilikos, Dimitrios M. (ed.) Forewords: Special issue on theory and applications of graph searching problems. (English) Zbl 1356.00046 Theor. Comput. Sci. 655, Part A, 1 (2016). MSC: 00B25 00B15 05-06 68-06 05C57 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} (ed.) et al., Theor. Comput. Sci. 655, Part A, 1 (2016; Zbl 1356.00046) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. (English) Zbl 1354.68120 Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 92-103 (2013). MSC: 68Q25 05C69 05C83 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 20, 92--103 (2013; Zbl 1354.68120) Full Text: DOI arXiv
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Linear kernels for (connected) dominating set on \(H\)-minor-free graphs. (English) Zbl 1421.68078 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 82-93 (2012). MSC: 68Q25 05C69 05C83 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 82--93 (2012; Zbl 1421.68078) Full Text: Link
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M. On exact algorithms for Treewidth. (English) Zbl 1301.05328 ACM Trans. Algorithms 9, No. 1, Article No. 12, 23 p. (2012). MSC: 05C85 68Q25 90C35 90C39 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., ACM Trans. Algorithms 9, No. 1, Article No. 12, 23 p. (2012; Zbl 1301.05328) Full Text: DOI
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M. A note on exact algorithms for vertex ordering problems on graphs. (English) Zbl 1253.68164 Theory Comput. Syst. 50, No. 3, 420-432 (2012). MSC: 68Q25 05C85 68Q17 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Theory Comput. Syst. 50, No. 3, 420--432 (2012; Zbl 1253.68164) Full Text: DOI
Fomin, Fedor V. (ed.); Fraigniaud, Pierre (ed.); Kreutzer, Stephan (ed.); Thilikos, Dimitrios M. (ed.) Special issue: Selected papers based on the presentations at the 4th workshop on GRAph searching, theory and applications, GRASTA 2011, February 13–18, 2012. Dedicated to Professor Lefteris M. Kirousis on the occasion of his 60th birthday. (English) Zbl 1283.05005 Theor. Comput. Sci. 463, 147 p. (2012). MSC: 05-06 68-06 00B25 05Cxx 68R10 91A43 PDFBibTeX XML
Barrière, Lali; Flocchini, Paola; Fomin, Fedor V.; Fraigniaud, Pierre; Nisse, Nicolas; Santoro, Nicola; Thilikos, Dimitrios M. Connected graph searching. (English) Zbl 1252.91026 Inf. Comput. 219, 1-16 (2012). MSC: 91A43 PDFBibTeX XMLCite \textit{L. Barrière} et al., Inf. Comput. 219, 1--16 (2012; Zbl 1252.91026) Full Text: DOI
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. Fast minor testing in planar graphs. (English) Zbl 1254.05185 Algorithmica 64, No. 1, 69-84 (2012). Reviewer: Ján Plesník (Bratislava) MSC: 05C83 05C10 05C85 90C39 PDFBibTeX XMLCite \textit{I. Adler} et al., Algorithmica 64, No. 1, 69--84 (2012; Zbl 1254.05185) Full Text: DOI Link
Dorn, Frederic; Fomin, Fedor V.; Thilikos, Dimitrios M. Catalan structures and dynamic programming in \(H\)-minor-free graphs. (English) Zbl 1244.05215 J. Comput. Syst. Sci. 78, No. 5, 1606-1622 (2012). MSC: 05C85 05C83 90C39 68Q25 PDFBibTeX XMLCite \textit{F. Dorn} et al., J. Comput. Syst. Sci. 78, No. 5, 1606--1622 (2012; Zbl 1244.05215) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Approximating width parameters of hypergraphs with excluded minors. (English) Zbl 1237.05141 SIAM J. Discrete Math. 25, No. 3, 1331-1348 (2011). MSC: 05C65 05C83 05C85 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 25, No. 3, 1331--1348 (2011; Zbl 1237.05141) Full Text: DOI Link
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. Faster parameterized algorithms for minor containment. (English) Zbl 1228.68035 Theor. Comput. Sci. 412, No. 50, 7018-7028 (2011). MSC: 68Q25 05C83 90C39 PDFBibTeX XMLCite \textit{I. Adler} et al., Theor. Comput. Sci. 412, No. 50, 7018--7028 (2011; Zbl 1228.68035) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr; Thilikos, Dimitrios M. Contraction obstructions for treewidth. (English) Zbl 1223.05022 J. Comb. Theory, Ser. B 101, No. 5, 302-314 (2011). MSC: 05C05 05C85 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Comb. Theory, Ser. B 101, No. 5, 302--314 (2011; Zbl 1223.05022) Full Text: DOI
Fomin, Fedor V.; Saurabh, Saket; Thilikos, Dimitrios M. Strengthening Erdős – Pósa property for minor-closed graph classes. (English) Zbl 1216.05148 J. Graph Theory 66, No. 3, 235-240 (2011). MSC: 05C83 05C75 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Graph Theory 66, No. 3, 235--240 (2011; Zbl 1216.05148) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Approximation algorithms for domination search. (English) Zbl 1314.68396 Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9–10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 130-141 (2011). MSC: 68W25 05C57 05C83 05C85 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Lect. Notes Comput. Sci. 6534, 130--141 (2011; Zbl 1314.68396) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Bidimensionality and kernels. (English) Zbl 1288.68116 Charikar, Moses (ed.), Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, SODA 2010, Austin, TX, USA, January 17–19, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-0-89871-698-6/CD-ROM). 503-510 (2010). MSC: 68Q25 05C85 05C83 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., in: Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, SODA 2010, Austin, TX, USA, January 17--19, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 503--510 (2010; Zbl 1288.68116) Full Text: arXiv
Fomin, Fedor V.; Oum, Sang-il; Thilikos, Dimitrios M. Rank-width and tree-width of \(H\)-minor-free graphs. (English) Zbl 1215.05171 Eur. J. Comb. 31, No. 7, 1617-1628 (2010). MSC: 05C83 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Eur. J. Comb. 31, No. 7, 1617--1628 (2010; Zbl 1215.05171) Full Text: DOI arXiv
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. Fast minor testing in planar graphs. (English) Zbl 1287.05141 de Berg, Mark (ed.) et al., Algorithms – ESA 2010. 18th annual European symposium, Liverpool, UK, September 6–8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 97-109 (2010). MSC: 05C85 05C10 05C83 68Q25 90C39 PDFBibTeX XMLCite \textit{I. Adler} et al., Lect. Notes Comput. Sci. 6346, 97--109 (2010; Zbl 1287.05141) Full Text: DOI Link
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. Faster parameterized algorithms for minor containment. (English) Zbl 1285.68206 Kaplan, Haim (ed.), Algorithm theory – SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 322-333 (2010). MSC: 68W05 05C83 05C85 68Q25 PDFBibTeX XMLCite \textit{I. Adler} et al., Lect. Notes Comput. Sci. 6139, 322--333 (2010; Zbl 1285.68206) Full Text: DOI
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M. (Meta) kernelization. (English) Zbl 1292.68089 2009 IEEE 50th annual symposium on foundations of computer science – FOCS 2009. Proceedings of the symposium, Atlanta, GA, USA, October 24–27, 2009. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-3850-1; 978-1-4244-5116-6/ebook). 629-638 (2009). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., in: 2009 IEEE 50th annual symposium on foundations of computer science -- FOCS 2009. Proceedings of the symposium, Atlanta, GA, USA, October 24--27, 2009. Los Alamitos, CA: IEEE Computer Society. 629--638 (2009; Zbl 1292.68089) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Approximating acyclicity parameters of sparse hypergraphs. (English) Zbl 1236.68089 Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26–28, 2009. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPIcs – Leibniz International Proceedings in Informatics 3, 445-456, electronic only (2009). MSC: 68Q17 05C85 05C65 05C83 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 3, 445--456 (2009; Zbl 1236.68089) Full Text: DOI Link
Fomin, Fedor V.; Golovach, Petr; Thilikos, Dimitrios M. Contraction bidimensionality: the accurate picture. (English) Zbl 1256.05202 Fiat, Amos (ed.) et al., Algorithms – ESA 2009. 17th annual European symposium, Copenhagen, Denmark, September 7–9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04127-3/pbk). Lecture Notes in Computer Science 5757, 706-717 (2009). MSC: 05C75 05C85 68W05 68W25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Lect. Notes Comput. Sci. 5757, 706--717 (2009; Zbl 1256.05202) Full Text: DOI Link
Dorn, Frederic; Fomin, Fedor V.; Thilikos, Dimitrios M. Subexponential parameterized algorithms. (English) Zbl 1302.68340 Comput. Sci. Rev. 2, No. 1, 29-39 (2008). MSC: 68W40 68Q25 68R10 05C85 68-02 PDFBibTeX XMLCite \textit{F. Dorn} et al., Comput. Sci. Rev. 2, No. 1, 29--39 (2008; Zbl 1302.68340) Full Text: DOI
Dorn, Frederic; Fomin, Fedor V.; Thilikos, Dimitrios M. Catalan structures and dynamic programming in \(H\)-minor-free graphs. (English) Zbl 1192.05155 Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 631-640 (2008). MSC: 05C85 05C83 68Q25 PDFBibTeX XMLCite \textit{F. Dorn} et al., in: Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2008, San Francisco, CA, January 20--22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 631--640 (2008; Zbl 1192.05155)
Fomin, Fedor V.; Thilikos, Dimitrios M. An annotated bibliography on guaranteed graph searching. (English) Zbl 1160.68007 Theor. Comput. Sci. 399, No. 3, 236-245 (2008). MSC: 68P10 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, Theor. Comput. Sci. 399, No. 3, 236--245 (2008; Zbl 1160.68007) Full Text: DOI
Dorn, Frederic; Fomin, Fedor V.; Thilikos, Dimitrios M. Subexponential parameterized algorithms. (English) Zbl 1171.68875 Arge, Lars (ed.) et al., Automata, languages and programming. 34th international colloquium, ICALP 2007, Wrocław, Poland, July 9–13, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73419-2/pbk). Lecture Notes in Computer Science 4596, 15-27 (2007). MSC: 68W40 68Q25 68R10 PDFBibTeX XMLCite \textit{F. Dorn} et al., Lect. Notes Comput. Sci. 4596, 15--27 (2007; Zbl 1171.68875) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimitrios M. On self duality of pathwidth in polyhedral graph embeddings. (English) Zbl 1117.05028 J. Graph Theory 55, No. 1, 42-54 (2007). MSC: 05C10 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, J. Graph Theory 55, No. 1, 42--54 (2007; Zbl 1117.05028) Full Text: DOI
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M. On exact algorithms for treewidth. (English) Zbl 1131.68481 Azar, Yossi (ed.) et al., Algorithms – ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11–13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). Lecture Notes in Computer Science 4168, 672-683 (2006). MSC: 68R10 05C85 68Q25 90C35 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Lect. Notes Comput. Sci. 4168, 672--683 (2006; Zbl 1131.68481) Full Text: DOI Link
Dorn, Frederic; Fomin, Fedor V.; Thilikos, Dimitrios M. Fast subexponential algorithm for non-local problems on graphs of bounded genus. (English) Zbl 1141.05338 Arge, Lars (ed.) et al., Algorithm theory – SWAT 2006. 10th Scandinavian workshop on algorithm theory, Riga, Latvia, July 6–8, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-35753-7/pbk). Lecture Notes in Computer Science 4059, 172-183 (2006). MSC: 05C85 68Q25 90C35 PDFBibTeX XMLCite \textit{F. Dorn} et al., Lect. Notes Comput. Sci. 4059, 172--183 (2006; Zbl 1141.05338) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimitrios M. Dominating sets in planar graphs: branch-width and exponential speed-up. (English) Zbl 1114.05072 SIAM J. Comput. 36, No. 2, 281-309 (2006). MSC: 05C69 05C35 05C83 05C85 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, SIAM J. Comput. 36, No. 2, 281--309 (2006; Zbl 1114.05072) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimitrios M. A 3-approximation for the pathwidth of Halin graphs. (English) Zbl 1109.05099 J. Discrete Algorithms 4, No. 4, 499-510 (2006). MSC: 05C85 68W25 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, J. Discrete Algorithms 4, No. 4, 499--510 (2006; Zbl 1109.05099) Full Text: DOI
Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammadtaghi; Thilikos, Dimitrios M. Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs. (English) Zbl 1326.05152 J. ACM 52, No. 6, 866-893 (2005). MSC: 05C85 05C10 05C69 05C70 05C83 68Q25 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., J. ACM 52, No. 6, 866--893 (2005; Zbl 1326.05152) Full Text: DOI
Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammadtaghi; Thilikos, Dimitrios M. Fixed-parameter algorithms for \((k, r)\)-center in planar graphs and map graphs. (English) Zbl 1321.05256 ACM Trans. Algorithms 1, No. 1, 33-47 (2005). MSC: 05C85 05C10 05C83 68Q25 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., ACM Trans. Algorithms 1, No. 1, 33--47 (2005; Zbl 1321.05256) Full Text: DOI Link
Fomin, Fedor V.; Thilikos, Dimitrios M.; Todinca, Ioan Connected graph searching in outerplanar graphs. (English) Zbl 1200.68170 Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 213-216 (2005). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Electron. Notes Discrete Math. 22, 213--216 (2005; Zbl 1200.68170) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimitrios M. New upper bounds on the decomposability of planar graphs. (English) Zbl 1085.05049 J. Graph Theory 51, No. 1, 53-81 (2006). MSC: 05C70 05C35 05C10 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, J. Graph Theory 51, No. 1, 53--81 (2005; Zbl 1085.05049) Full Text: DOI
Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M. Subexponential parameterized algorithms on graphs of bounded-genus and \(H\)-minor-free graphs. (English) Zbl 1318.05076 Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 830-839 (2004). MSC: 05C85 05C10 05C69 05C70 68Q17 68Q25 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., in: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11--13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 830--839 (2004; Zbl 1318.05076)
Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M. Bidimensional parameters and local treewidth. (English) Zbl 1196.68169 Farach-Colton, Martin (ed.), LATIN 2004: Theoretical informatics. 6th Latin American symposium, Buenos Aires, Argentina, April 5–8, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21258-2/pbk). Lecture Notes in Computer Science 2976, 109-118 (2004). MSC: 68R10 05C69 68Q25 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Lect. Notes Comput. Sci. 2976, 109--118 (2004; Zbl 1196.68169) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimtirios M. A simple and fast approach for solving problems on planar graphs. (English) Zbl 1122.68480 Diekert, Volker (ed.) et al., STACS 2004. 21st annual symposium on theoretical aspects of computer science, Montpellier, France, March 25–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21236-1/pbk). Lecture Notes in Computer Science 2996, 56-67 (2004). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, Lect. Notes Comput. Sci. 2996, 56--67 (2004; Zbl 1122.68480) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimitrios M. A 3-approximation for the pathwidth of Halin graphs. (English) Zbl 1152.05375 Liberti, Leo (ed.) et al., Workshop on graphs and combinatorial optimization. Papers from the workshop, Como, Italy, May 31, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 17, 157-162 (2004). MSC: 05C85 68W25 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, Electron. Notes Discrete Math. 17, 157--162 (2004; Zbl 1152.05375) Full Text: DOI
Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M. Bidimensional parameters and local treewidth. (English) Zbl 1069.05070 SIAM J. Discrete Math. 18, No. 3, 501-511 (2004). MSC: 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., SIAM J. Discrete Math. 18, No. 3, 501--511 (2004; Zbl 1069.05070) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimitrios M. Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. (English) Zbl 1099.68077 Díaz, Josep (ed.) et al., Automata, languages and programming. 31st international colloquium, ICALP 2004, Turku, Finland, July 12–16, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22849-7/pbk). Lecture Notes in Computer Science 3142, 581-592 (2004). MSC: 68R10 05C10 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, Lect. Notes Comput. Sci. 3142, 581--592 (2004; Zbl 1099.68077) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimtirios M. Dominating sets and local treewidth. (English) Zbl 1266.05164 Di Battista, Giuseppe (ed.) et al., Algorithms – ESA 2003. 11th annual European symposium, Budapest, Hungary, September 16–19, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20064-9/pbk). Lect. Notes Comput. Sci. 2832, 221-229 (2003). MSC: 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, Lect. Notes Comput. Sci. 2832, 221--229 (2003; Zbl 1266.05164) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimitrios M. Dominating sets in planar graphs: Branch-width and exponential speed-up. (English) Zbl 1094.68610 Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, USA, January 12–14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics (ISBN 0-89871-538-5/pbk). 168-177 (2003). MSC: 68R10 05C83 05C85 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, in: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2003, Baltimore, MD, USA, January 12--14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics. 168--177 (2003; Zbl 1094.68610)
Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M. Fixed-parameter algorithms for the \((k,r)\)-center in planar graphs and map graphs. (English) Zbl 1039.68093 Baeten, Jos C. M. (ed.) et al., Automata, languages and programming. 30th international colloquium, ICALP 2003, Eindhoven, The Netherland, June 30 – July 4, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40493-7/pbk). Lect. Notes Comput. Sci. 2719, 829-844 (2003). MSC: 68R10 05C85 68Q25 05C83 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Lect. Notes Comput. Sci. 2719, 829--844 (2003; Zbl 1039.68093) Full Text: Link
Fomin, Fedor V.; Thilikos, Dimitrios M. On the monotonicity of games generated by symmetric submodular functions. (English) Zbl 1069.91019 Discrete Appl. Math. 131, No. 2, 323-335 (2003). Reviewer: Anton Ştefănescu (Bucureşti) MSC: 91A43 05C99 05C40 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, Discrete Appl. Math. 131, No. 2, 323--335 (2003; Zbl 1069.91019) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimitrios M. On the monotonicity of games generated by symmetric submodular functions. (English) Zbl 1042.68631 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 27th international workshop, WG 2001, Boltenhagen, Germany, June 14–16, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42707-4). Lect. Notes Comput. Sci. 2204, 177-188 (2001). MSC: 68R10 91A80 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, Lect. Notes Comput. Sci. 2204, 177--188 (2001; Zbl 1042.68631) Full Text: Link