Výsledky vyhledávání - "parameterised complexity"

The Complexity of Homomorphism Reconstructibility

Autoři: Jan Böker Louis Härtel Nina Runde a další

Přispěvatelé: Jan Böker Louis Härtel Nina Runde a další

Zdroj: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14
41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)

Témata: FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), Theory of computation → Graph algorithms analysis, graph homomorphism, parameterised complexity, Computer Science - Data Structures and Algorithms, counting complexity, FOS: Mathematics, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2310.09009
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.19
https://publications.rwth-aachen.de/record/981455

Counting Subgraphs in Somewhere Dense Graphs

Autoři: Marco Bressan Leslie Ann Goldberg Kitty Meeks a další

Přispěvatelé: Marco Bressan Leslie Ann Goldberg Kitty Meeks a další

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

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: 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

Parameterised and Fine-Grained Subgraph Counting, Modulo 2

Autoři: Goldberg, L Roth, M Leslie Ann Goldberg and Marc Roth

Přispěvatelé: Goldberg, L Roth, M Leslie Ann Goldberg and Marc Roth

Zdroj: Algorithmica. 86:944-1005

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Discrete Mathematics (cs.DM), parameterised complexity, fine-grained complexity, modular counting, 0102 computer and information sciences, ddc:004, Computational Complexity (cs.CC), subgraph counting, 01 natural sciences, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2301.01696
https://ora.ox.ac.uk/objects/uuid:820ac699-0b74-4238-8fcf-22cfc307c20c
https://doi.org/10.1007/s00453-023-01178-0
https://ora.ox.ac.uk/objects/uuid:d27f72b8-97a6-4962-8a22-24601e2d7c42
https://doi.org/10.4230/lipics.icalp.2023.68
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.68

Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds

Autoři: Manea, Florin Richardsen, Jonas Schmid, Markus L. a další

Přispěvatelé: Manea, Florin Richardsen, Jonas Schmid, Markus L. a další

Témata: String algorithms, FOS: Computer and information sciences, pattern matching, conditional lower bounds, fine-grained complexity, parameterised complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, subsequences with gap constraints

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2404.10497
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2024.22

The Complexity of Homomorphism Reconstructibility

Autoři: Böker, Jan Wilhelm Härtel, Louis Runde, Nina Katrin a další

Zdroj: Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Leibniz International Proceedings in Informatics : LIPIcs 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19 ; 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024) ; 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024) 41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11 - 2024-03-15

Témata: Mathematics of computing → Graph theory, Theory of computation → Graph algorithms analysis, Theory of computation → Parameterized complexity and exact algorithms, counting complexity, graph homomorphism, parameterised complexity

Geografické téma: DE

Relation: info:eu-repo/semantics/altIdentifier/issn/1868-8969; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-311-9; info:eu-repo/semantics/altIdentifier/wos/WOS:001300393400019; info:eu-repo/grantAgreement/EC//101054974

Dostupnost: https://publications.rwth-aachen.de/record/981455
https://publications.rwth-aachen.de/search?p=id:%22RWTH-2024-03047%22

The Complexity of Homomorphism Reconstructibility

Autoři: Böker, Jan Härtel, Louis Runde, Nina a další

Přispěvatelé: Böker, Jan Härtel, Louis Runde, Nina a další

Témata: graph homomorphism, counting complexity, parameterised complexity

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.19

Dostupnost: https://doi.org/10.4230/LIPIcs.STACS.2024.19
https://nbn-resolving.org/urn:nbn:de:0030-drops-197298
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.19

Deleting edges to restrict the size of an epidemic in temporal networks

Autoři: Enright, Jessica Meeks, Kitty Mertzios, George B. a další

Přispěvatelé: Enright, Jessica Meeks, Kitty Mertzios, George B. a další

Zdroj: JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Rossmanith, Peter & Heggernes, Pinar & Katoen, Joost-Pieter (Eds.). (2019). 44th International Symposium on Mathematical Foundations of Computer Science. Saarbrücken/Wadern: Schloss Dagstuhl, pp. 57:1-57:15, LIPIcs (Leibniz International Proceedings in Informatics)(138)
Journal of computer and system sciences, 2021, Vol.119, pp.60-77 [Peer Reviewed Journal]

Témata: FOS: Computer and information sciences, Temporal networks, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, parameterised complexity, graph modification, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, spreading processes

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2019/11001/pdf/LIPIcs-MFCS-2019-57.pdf
http://arxiv.org/abs/1805.06836
https://eprints.gla.ac.uk/233459/2/233459.pdf
http://livrepository.liverpool.ac.uk/3115893/1/JCSS_revision_submission_3.pdf
https://eprints.gla.ac.uk/189166/1/189166.pdf
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2019.html#EnrightMMZ19
https://dro.dur.ac.uk/28724/
http://eprints.gla.ac.uk/189166/
http://ui.adsabs.harvard.edu/abs/2018arXiv180506836E/abstract
https://dblp.uni-trier.de/db/journals/corr/corr1805.html#abs-1805-06836
https://www.sciencedirect.com/science/article/pii/S0022000021000155
https://dro.dur.ac.uk/32582/
https://doi.org/10.1016/j.jcss.2021.01.007
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.57
http://dro.dur.ac.uk/28724/1/28724.pdf
http://dro.dur.ac.uk/28724/
https://doi.org/10.4230/LIPIcs.MFCS.2019.57
http://dro.dur.ac.uk/28724/2/28724.pdf
http://dro.dur.ac.uk/32582/1/32582.pdf
https://doi.org/10.1016/j.jcss.2021.01.007
http://dro.dur.ac.uk/32582/

Strong Backdoors for Default Logic

Autoři: Fichte, Johannes Klaus Meier, Arne Schindler, Irena

Zdroj: eLLIIT – The Linköping – Lund Initiative on IT and Mobile Communication ACM Transactions on Computational Logic. 25(3)

Témata: Parameterised complexity, default logic, backdoors

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-202588

A new temporal interpretation of cluster editing

Autoři: Cristiano Bocci Chiara Capresi Kitty Meeks a další

Přispěvatelé: Cristiano Bocci Chiara Capresi Kitty Meeks a další

Témata: Temporal graphs, Cluster editing, Graph clustering, Parameterised complexity

Popis souboru: ELETTRONICO

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001247310900001; volume:144; numberofpages:21; journal:JOURNAL OF COMPUTER AND SYSTEM SCIENCES; https://hdl.handle.net/11365/1280040; https://www.sciencedirect.com/science/article/pii/S0022000024000461?via=ihub#ac0010

Dostupnost: https://hdl.handle.net/11365/1280040
https://doi.org/10.1016/j.jcss.2024.103551
https://www.sciencedirect.com/science/article/pii/S0022000024000461?via=ihub#ac0010

A Fixed-Parameter Perspective on #BIS

Autoři: Curticapean, R Dell, H Fomin, F a další

Přispěvatelé: Curticapean, R Dell, H Fomin, F a další

Zdroj: Curticapean, R, Dell, H, Fomin, F, Goldberg, L A & Lapinskas, J A 2019, ' A fixed-parameter perspective on #BIS ', Algorithmica, vol. 81, no. 10, pp. 3844-3864 . https://doi.org/10.1007/s00453-019-00606-4
Curticapean, R-C, Dell, H, Fomin, F, Goldberg, L A & Lapinskas, J 2019, 'A Fixed-Parameter Perspective on #BIS', Algorithmica, vol. 81, no. 10, pp. 3844–3864. https://doi.org/10.1007/s00453-019-00606-4
Algorithmica

Témata: FOS: Computer and information sciences, name=Algorithms and Complexity, G.2.1, G.2.2, 0102 computer and information sciences, Computational Complexity (cs.CC), F.2.2, 01 natural sciences, Computer Science - Computational Complexity, independent sets, Approximate counting, parameterised complexity, Independent sets, Parameterised complexity, ddc:004, 0101 mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007/s00453-019-00606-4.pdf
http://arxiv.org/abs/1702.05543
https://arxiv.org/abs/1702.05543
http://ui.adsabs.harvard.edu/abs/2017arXiv170205543C/abstract
https://arxiv.org/pdf/1702.05543.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.13
https://research-information.bris.ac.uk/en/publications/ecb5c34c-d6be-44ec-97ea-080f57c5e6af
https://hdl.handle.net/1983/ecb5c34c-d6be-44ec-97ea-080f57c5e6af
https://pure.itu.dk/ws/files/84707589/1702.05543.pdf
https://hdl.handle.net/1956/21835

Domination chain: Characterisation, classical complexity, parameterised complexity and approximability: Domination chain: characterisation, classical complexity, parameterised complexity and approximability

Autoři: Bazgan, Cristina Brankovic, Ljiljana Casel, Katrin a další

Přispěvatelé: Bazgan, Cristina Brankovic, Ljiljana Casel, Katrin a další

Zdroj: Discrete Applied Mathematics. 280:23-42

Témata: Approximation complexity, 0211 other engineering and technologies, Parameterized complexity, tractability and kernelization, classical complexity, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, Classical complexity, Planar graphs, geometric and topological aspects of graph theory, Domination chain, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), approximation complexity, Graph algorithms (graph-theoretic aspects), parameterised complexity, Modèles mathématiques. Algorithmes, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Parameterised complexity, domination chain, special graph classes, Special graph classes

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://basepub.dauphine.psl.eu/bitstream/123456789/22260/2/Domination-chain.pdf
https://zbmath.org/7201702
https://doi.org/10.1016/j.dam.2019.10.005

Parameterised complexity of model checking and satisfiability in propositional dependence logic

Autoři: Yasir Mahmood Arne Meier

Zdroj: Lecture Notes in Computer Science ISBN: 9783030399504

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Model checking, Propositional dependence logic, 0102 computer and information sciences, Computational Complexity (cs.CC), 16. Peace & justice, 01 natural sciences, Dewey Decimal Classification::500 | Naturwissenschaften::510 | Mathematik, Logic in Computer Science (cs.LO), Computer Science - Computational Complexity, Dewey Decimal Classification::000 | Allgemeines, Wissenschaft::000 | Informatik, Wissen, Systeme::004 | Informatik, Parameterised complexity, Satisfiability, 0101 mathematics

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007/s10472-021-09730-w.pdf
http://arxiv.org/abs/1904.06107
https://link.springer.com/content/pdf/10.1007/s10472-021-09730-w.pdf
https://doi.org/10.1007/978-3-030-39951-1_10
https://rd.springer.com/chapter/10.1007/978-3-030-39951-1_10
https://link.springer.com/article/10.1007/s10472-021-09730-w
http://ui.adsabs.harvard.edu/abs/2019arXiv190406107M/abstract
https://dblp.uni-trier.de/db/journals/corr/corr1904.html#abs-1904-06107

The Parameterised Complexity of Integer Multicommodity Flow

Autoři: Bodlaender, Hans L. Mannens, Isja Oostveen, Jelle J. a další

Přispěvatelé: Bodlaender, Hans L. Mannens, Isja Oostveen, Jelle J. a další

Zdroj: 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)

Témata: FOS: Computer and information sciences, XNLP-completeness, Discrete Mathematics (cs.DM), Computational Complexity (cs.CC), multicommodity flow, Computer Science - Computational Complexity, XALPcompleteness, XALP-completeness, parameterised complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Software, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2310.05784
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.6
https://dspace.library.uu.nl/handle/1874/436469

Counting Subgraphs in Somewhere Dense Graphs

Autoři: Marco Bressan Leslie Ann Goldberg Kitty Meeks a další

Přispěvatelé: Marco Bressan Leslie Ann Goldberg Kitty Meeks a další

Témata: counting problem, parameterised complexity theory, somewhere dense graphs, Settore INF/01 - Informatica

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-263-1; info:eu-repo/semantics/altIdentifier/wos/WOS:001532714400027; ispartofbook:14th Innovations in Theoretical Computer Science Conference (ITCS 2023); Innovations in Theoretical Computer Science Conference (ITCS); volume:251; firstpage:27: 1; lastpage:27: 14; numberofpages:14; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; alleditors:Y.T. Kalai; https://hdl.handle.net/2434/961285

Dostupnost: https://hdl.handle.net/2434/961285
https://doi.org/10.4230/lipics.itcs.2023.27
https://drops.dagstuhl.de/opus/volltexte/2023/17530/pdf/LIPIcs-ITCS-2023-27.pdf

Parameterised and Fine-Grained Subgraph Counting, Modulo 2

Autoři: Goldberg, Leslie Ann Roth, Marc Leslie Ann Goldberg and Marc Roth

Přispěvatelé: Goldberg, Leslie Ann Roth, Marc Leslie Ann Goldberg and Marc Roth

Témata: modular counting, parameterised complexity, fine-grained complexity, subgraph counting

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.68

Dostupnost: https://doi.org/10.4230/LIPIcs.ICALP.2023.68
https://nbn-resolving.org/urn:nbn:de:0030-drops-181200
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.68

Consensus Strings with Small Maximum Distance and Small Distance Sum

Autoři: Bulteau, Laurent Schmid, Markus Laurent Bulteau and Markus L. Schmid

Přispěvatelé: Bulteau, Laurent Schmid, Markus Laurent Bulteau and Markus L. Schmid

Zdroj: Algorithmica. 82:1378-1409

Témata: Consensus String Problems, 0206 medical engineering, Closest String, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, Kernelisation, Closest Substring, Parameterised Complexity, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], ddc:004, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2018/9583/pdf/LIPIcs-MFCS-2018-1.pdf
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2018.html#BulteauS18
https://drops.dagstuhl.de/opus/volltexte/2018/9583/
https://drops.dagstuhl.de/opus/volltexte/2018/9583/pdf/LIPIcs-MFCS-2018-1.pdf/
https://link.springer.com/article/10.1007/s00453-019-00647-9
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica82.html#BulteauS20
https://hal.archives-ouvertes.fr/hal-02382881
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.1
https://hal.science/hal-01930623v1/document
https://hal.science/hal-01930623v1
https://doi.org/10.4230/lipics.mfcs.2018.1

Constrained flows in networks

Autoři: Bang-Jensen, Jørgen Bessy, Stéphane Picasarri-Arrieta, Lucas a další

Přispěvatelé: Bang-Jensen, Jørgen Bessy, Stéphane Picasarri-Arrieta, Lucas a další

Zdroj: Theoretical Computer Science. 1010:114702

Témata: FOS: Computer and information sciences, Polynomial time algorithm, Discrete Mathematics (cs.DM), (Arc-)disjoint paths with prescribed end vertices, Flows, Approximation algorithm, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], NP-complete problem, FOS: Mathematics, Mathematics - Combinatorics, Acyclic digraph, Parameterised complexity, Combinatorics (math.CO), Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/2310.01042
https://inria.hal.science/hal-04379871v1
https://doi.org/10.1016/j.tcs.2024.114702
https://portal.findresearcher.sdu.dk/da/publications/232b7a02-f082-486e-b6df-813e5b7efd4d
https://doi.org/10.1016/j.tcs.2024.114702

Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems

Autoři: Day, Joel D. Kosche, Maria Manea, Florin a další

Přispěvatelé: Day, Joel D. Kosche, Maria Manea, Florin a další

Témata: String algorithms, subsequences with gap constraints, pattern matching, fine-grained complexity, conditional lower bounds, parameterised complexity

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.64

Dostupnost: https://doi.org/10.4230/LIPIcs.ISAAC.2022.64
https://nbn-resolving.org/urn:nbn:de:0030-drops-173493
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.64

Making Life More Confusing for Firefighters

Autoři: Hand, Samuel D. Enright, Jessica Meeks, Kitty a další

Přispěvatelé: Hand, Samuel D. Enright, Jessica Meeks, Kitty a další

Témata: Temporal graphs, Spreading processes, Parameterised complexity

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 226, 11th International Conference on Fun with Algorithms (FUN 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.15

Dostupnost: https://doi.org/10.4230/LIPIcs.FUN.2022.15
https://nbn-resolving.org/urn:nbn:de:0030-drops-159851
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.15

Parameterised Partially-Predrawn Crossing Number

Autoři: Hamm, Thekla Hliněný, Petr Thekla Hamm and Petr Hliněný

Přispěvatelé: Hamm, Thekla Hliněný, Petr Thekla Hamm and Petr Hliněný

Témata: Crossing Number, Drawing Extension, Partial Planarity, Parameterised Complexity

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.46

Dostupnost: https://doi.org/10.4230/LIPIcs.SoCG.2022.46
https://nbn-resolving.org/urn:nbn:de:0030-drops-160547
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.46