Counting Subgraphs in Somewhere Dense Graphs

Authors: Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth

Contributors: Marco Bressan and Leslie Ann Goldberg and Kitty Meeks and Marc Roth

Source: SIAM Journal on Computing. 53:1409-1438

Subject Terms: 0301 basic medicine, FOS: Computer and information sciences, parameterised complexity theory, counting problems, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, somewhere dense graphs, Computer Science - Computational Complexity, 03 medical and health sciences, parameterized complexity theory, ddc:004, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2209.03402
https://ora.ox.ac.uk/objects/uuid:ec3d7a28-7134-415f-8d64-4aa422b7edaf
https://doi.org/10.1137/22m1535668
https://drops.dagstuhl.de/opus/volltexte/2023/17530/pdf/LIPIcs-ITCS-2023-27.pdf
https://hdl.handle.net/2434/961285
https://doi.org/10.4230/lipics.itcs.2023.27
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.27

A SUBSET-SUM Characterisation of the A-Hierarchy

Authors: Gutleben, Jan^Aff9, Meier, Arne^Aff9

Contributors: Goos, Gerhard, Series Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Královič, Rastislav, editor^Aff7, Kůrková, Věra, editor^Aff8

Source: SOFSEM 2025: Theory and Practice of Computer Science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part II. 15539:31-44

Parameterized Algorithms for Covering by Arithmetic Progressions

Authors: Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi

Source: Lecture Notes in Computer Science ISBN: 9783031521126
Lecture Notes in Computer Science, SOFSEM 2024: Theory and Practice of Computer Science

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, F.2, Number Theory, parameterized complexity theory, Arithmetic Progressions, Computational Complexity (cs.CC), Set Cover, 11Y16, Parameterized Complexity

Access URL: http://arxiv.org/abs/2312.06393

Parameterized Completeness Results for Bayesian Inference

Authors: Bodlaender, Hans L., Donselaar, Nils, Kwisthout, Johan

Contributors: Sub Algorithms and Complexity, Algorithms and Complexity, Salmerón, Antonio, Rumí, Rafael

Subject Terms: Bayesian networks, inference, parameterized complexity theory

File Description: application/pdf

Relation: https://dspace.library.uu.nl/handle/1874/425131

Availability: https://dspace.library.uu.nl/handle/1874/425131

Parameterized Counting of Partially Injective Homomorphisms

Authors: Roth, Marc^{Aff1, Aff2, IDs0045302100805y_cor1}

Source: Algorithmica. 83(6):1829-1860

Probabilistic Parameterized Polynomial Time

Authors: Donselaar, Nils^Aff16

Contributors: Hutchison, David, Series Editor^Aff1, Kanade, Takeo, Series Editor^Aff2, Kittler, Josef, Series Editor^Aff3, Kleinberg, Jon M., Series Editor^Aff4, Mattern, Friedemann, Series Editor^Aff5, Mitchell, John C., Series Editor^Aff6, Naor, Moni, Series Editor^Aff7, Pandu Rangan, C., Series Editor^Aff8, Steffen, Bernhard, Series Editor^Aff9, Terzopoulos, Demetri, Series Editor^Aff10, Tygar, Doug, Series Editor^Aff11, Catania, Barbara, editor^Aff12, Královič, Rastislav, editor^Aff13, Nawrocki, Jerzy, editor^Aff14, Pighizzini, Giovanni, editor^Aff15

Source: SOFSEM 2019: Theory and Practice of Computer Science : 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings. 11376:179-191

A multiparametric view on answer set programming

Authors: Fichte, Johannes K.^{Aff1, cor1}, Kronegger, Martin^{Aff2, Aff3, cor2}, Woltran, Stefan^{Aff3, cor3}

Source: Annals of Mathematics and Artificial Intelligence. :1-27

Parameterized Valiant's Classes

Authors: Bläser, Markus, Engels, Christian

Contributors: Markus Bläser and Christian Engels

Subject Terms: FOS: Computer and information sciences, 4. Education, 0102 computer and information sciences, Valiant's classes, Computational Complexity (cs.CC), 7. Clean energy, 01 natural sciences, 12. Responsible consumption, Computer Science - Computational Complexity, 11. Sustainability, parameterized complexity theory, Algebraic complexity theory, ddc:004, 0101 mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/1907.12287
https://arxiv.org/abs/1907.12287
https://dblp.uni-trier.de/db/journals/corr/corr1907.html#abs-1907-12287
http://arxiv.org/pdf/1907.12287.pdf
https://drops.dagstuhl.de/opus/volltexte/2019/11464/pdf/LIPIcs-IPEC-2019-3.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.3

On the Space Complexity of Parameterized Problems

Authors: Elberfeld, Michael^Aff18, Stockhusen, Christoph^Aff18, Tantau, Till^Aff18

Contributors: Hutchison, David, editor^Aff1, Kanade, Takeo, editor^Aff2, Kittler, Josef, editor^Aff3, Kleinberg, Jon M., editor^Aff4, Mattern, Friedemann, editor^Aff5, Mitchell, John C., editor^Aff6, Naor, Moni, editor^Aff7, Nierstrasz, Oscar, editor^Aff8, Pandu Rangan, C., editor^Aff9, Steffen, Bernhard, editor^Aff10, Sudan, Madhu, editor^Aff11, Terzopoulos, Demetri, editor^Aff12, Tygar, Doug, editor^Aff13, Vardi, Moshe Y., editor^Aff14, Weikum, Gerhard, editor^Aff15, Thilikos, Dimitrios M., editor^Aff16, Woeginger, Gerhard J., editor^Aff17

Source: Parameterized and Exact Computation : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings. 7535:206-217

Important Separators and Parameterized Algorithms

Authors: Marx, Dániel^Aff17

Contributors: Hutchison, David, Series editor^Aff1, Kanade, Takeo, Series editor^Aff2, Kittler, Josef, Series editor^Aff3, Kleinberg, Jon M., Series editor^Aff4, Mattern, Friedemann, Series editor^Aff5, Mitchell, John C., Series editor^Aff6, Naor, Moni, Series editor^Aff7, Nierstrasz, Oscar, Series editor^Aff8, Pandu Rangan, C., Series editor^Aff9, Steffen, Bernhard, Series editor^Aff10, Sudan, Madhu, Series editor^Aff11, Terzopoulos, Demetri, Series editor^Aff12, Tygar, Doug, Series editor^Aff13, Vardi, Moshe Y., Series editor^Aff14, Weikum, Gerhard, Series editor^Aff15, Kolman, Petr, editor^Aff16, Kratochvíl, Jan, editor^Aff16

Source: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers. 6986:5-10

The Parameterized Complexity of Positional Games

Authors: Bonnet, Edouard, Gaspers, Serge, Lambilliotte, Antonin, Rümmele, Stefan, Saffidine, Abdallah

Contributors: Middlesex University London, Data61 Canberra (CSIRO), Australian National University (ANU)-Commonwealth Scientific and Industrial Research Organisation Australia (CSIRO), École normale supérieure de Lyon (ENS de Lyon), Université de Lyon

Source: ICALP ; https://hal.science/hal-01994361 ; ICALP, Jul 2017, Varsovie, Poland. ⟨10.4230/LIPIcs⟩

Subject Terms: Hex, Maker-Maker games, Maker-Breaker games, Enforcer-Avoider games, parameterized complexity theory, [INFO]Computer Science [cs], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Subject Geographic: Varsovie, Poland

Availability: https://hal.science/hal-01994361
https://hal.science/hal-01994361v1/document
https://hal.science/hal-01994361v1/file/short-positional-games.pdf
https://doi.org/10.4230/LIPIcs

Intractability in Graph Drawing and Geometry: FPT Approaches

Authors: Whitesides, Sue^Aff18

Contributors: Hutchison, David, editor^Aff1, Kanade, Takeo, editor^Aff2, Kittler, Josef, editor^Aff3, Kleinberg, Jon M., editor^Aff4, Mattern, Friedemann, editor^Aff5, Mitchell, John C., editor^Aff6, Naor, Moni, editor^Aff7, Nierstrasz, Oscar, editor^Aff8, Pandu Rangan, C., editor^Aff9, Steffen, Bernhard, editor^Aff10, Sudan, Madhu, editor^Aff11, Terzopoulos, Demetri, editor^Aff12, Tygar, Doug, editor^Aff13, Vardi, Moshe Y., editor^Aff14, Weikum, Gerhard, editor^Aff15, Fiala, Jiří, editor^Aff16, Kratochvíl, Jan, editor^Aff16, Miller, Mirka, editor^Aff17

Source: Combinatorial Algorithms : 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28–July 2, 2009, Revised Selected Papers. 5874:20-23

Parameterized Approximability of the Disjoint Cycle Problem

Authors: Grohe, Martin^Aff1, Grüber, Magdalena^Aff1

Contributors: Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Arge, Lars, editor, Cachin, Christian, editor, Jurdziński, Tomasz, editor, Tarlecki, Andrzej, editor

Source: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, Wrocław, Poland, July 9-13, 2007. Proceedings. 4596:363-374

Bridging the gap between theory and practice of approximate Bayesian inference

Authors: Kwisthout, Johan ^⁎, van Rooij, Iris

Source: In Cognitive Systems Research September 2013 24:2-8

Bounded fixed-parameter tractability and reducibility

Authors: Jörg Flum, Rodney G. Downey, Mark Weyer, Martin Grohe

Source: Annals of Pure and Applied Logic. 148:1-19

Subject Terms: Parameterized complexity theory, Logic, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Reductions, 01 natural sciences

Access URL: http://www.sciencedirect.com/science/article/pii/S0168007207000577
http://homepages.ecs.vuw.ac.nz/~downey/publications/bounded.pdf
http://homepages.msor.vuw.ac.nz/~downey/publications/bounded.pdf
https://www.sciencedirect.com/science/article/pii/S0168007207000577
https://dblp.uni-trier.de/db/journals/apal/apal148.html#DowneyFGW07
https://core.ac.uk/display/82297967

On the parametric complexity of schedules to minimize tardy tasks: On the parametric complexity of schedules to minimize tardy tasks.

Authors: Michael R. Fellows, Catherine McCartin

Source: Theoretical Computer Science. 298:317-324

Subject Terms: parameterized complexity theory, 0211 other engineering and technologies, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

File Description: application/xml

Access URL: https://zbmath.org/1915465
https://doi.org/10.1016/s0304-3975(02)00811-3
http://www.mrfellows.net/papers/FM03_MinimizeTardyTasks.pdf
https://dblp.uni-trier.de/db/journals/tcs/tcs298.html#FellowsM03
https://www.sciencedirect.com/science/article/abs/pii/S0304397502008113
https://www.sciencedirect.com/science/article/pii/S0304397502008113

Parameterized Random Complexity

Authors: Montoya, Juan Andrés, Müller, Moritz

Source: Theory of Computing Systems. February 2013 52(2):221-270

The Parameterized Complexity of Abduction

Authors: Fellows, Michael, Pfandler, Andreas, Rosamond, Frances, Rümmele, Stefan

Source: Proceedings of the AAAI Conference on Artificial Intelligence; Vol. 26 No. 1 (2012): Twenty-Sixth AAAI Conference on Artificial Intelligence; 743-749 ; 2374-3468 ; 2159-5399

Subject Terms: Abduction, Complexity Theory, Parameterized Complexity Theory, Kernelization

File Description: application/pdf

Relation: https://ojs.aaai.org/index.php/AAAI/article/view/8224/8082; https://ojs.aaai.org/index.php/AAAI/article/view/8224

Availability: https://ojs.aaai.org/index.php/AAAI/article/view/8224
https://doi.org/10.1609/aaai.v26i1.8224

Bridging the gap between theory and practice of approximate Bayesian inference

Authors: Iris Van Rooij

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://repository.ubn.ru.nl/bitstream/handle/2066/93772/93772.pdf.

Subject Terms: Bayesian inference, approximation, NP-hard, parameterized complexity theory

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1026.3501; http://repository.ubn.ru.nl/bitstream/handle/2066/93772/93772.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1026.3501
http://repository.ubn.ru.nl/bitstream/handle/2066/93772/93772.pdf

The parameterized complexity of nonmonotonic reasoning

Authors: Rümmele, Stefan

Contributors: Pichler, Reinhard, Scarcello, Francesco, Brewka, Gerhard

Subject Terms: Parametrisierte Komplexitätstheorie, Nichtmonotones Schließen, Wissensrevision, Antwortmengenprogrammierung, Abduktion, Parameterized Complexity Theory, Nonmonotonic Reasoning, Belief Revision, Answer-Set Programming, Abduction

File Description: 103 S.

Relation: https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-56578; http://hdl.handle.net/20.500.12708/12935; AC07814155; urn:nbn:at:at-ubtuw:1-56578

Availability: https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-56578
https://hdl.handle.net/20.500.12708/12935