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

The Parameterised Complexity of Computing the Maximum Modularity of a Graph

Autoři: Meeks, Kitty Skerman, Fiona

Zdroj: Algorithmica. 82(8):2174-2199

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-569665
https://doi.org/10.1007/s00453-019-00649-7

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

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

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 Consistent Query Answering via Graph Representations

Autoři: Hankala, Teemu Hannula, Miika Mahmood, Yasir a další

Témata: Computer Science - Databases, Computer Science - Computational Complexity, text

URL: http://arxiv.org/abs/2412.08324

The Parameterised Complexity Of Integer Multicommodity Flow

Autoři: Mannens, Isja Oostveen, Jelle van Leeuwen, Erik Jan a další

Zdroj: Misra, Neeldhara , Wahlström, Magnus (Ed.), 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), p.91-109. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [ISBN 978-3-95977-305-8]

Témata: XALPcompleteness, XNLP-completeness, multicommodity flow, parameterised complexity, Conference contribution

URL: https://research-portal.uu.nl/en/publications/b6235288-b3c3-484f-ac67-cd64d6dcdb01
https://dspace.library.uu.nl/bitstream/handle/1874/436469/LIPIcs.IPEC.2023.6.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/436469/LIPIcs.IPEC.2023.6.pdf?sequence=1

The Parameterised Complexity Of Integer Multicommodity Flow

Autoři: Hans L. Bodlaender and Isja Mannens and Jelle J. Oostveen and Sukanya Pandey and Erik Jan van Leeuwen Bodlaender, Hans L. Mannens, Isja a další

Témata: multicommodity flow, parameterised complexity, XNLP-completeness, XALP-completeness, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.6
Is Part Of LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)

On the Parameterised Complexity of String Morphism Problems

Autoři: Fernau, Henning Schmid, Markus L. Villanger, Yngve a další

Přispěvatelé: Fernau, Henning Schmid, Markus L. Villanger, Yngve a další

Zdroj: Theory of Computing Systems. 59:24-51

Témata: Parameterised Complexity, Pattern Languages, String Problems, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, ddc:004, Exponential Time Hypothesis, 01 natural sciences, String Morphisms

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2013/4361/pdf/2.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.55

Parameterised complexity of spreading problems on temporal graphs

Autoři: Hand, Samuel

Témata: QA75 Electronic computers. Computer science

Popis souboru: pdf

Parameterised Complexity of Abduction in Schaefer’s Framework

Autoři: Yasir Mahmood Arne Meier Johannes Schmidt

Zdroj: Lecture Notes in Computer Science ISBN: 9783030367541

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Logic in Computer Science, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 16. Peace & justice, 01 natural sciences, Logic in Computer Science (cs.LO)

Přístupová URL adresa: http://arxiv.org/pdf/1906.00703
http://arxiv.org/abs/1906.00703
https://rd.springer.com/chapter/10.1007/978-3-030-36755-8_13
https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=202002214678733754
http://www.diva-portal.org/smash/record.jsf?pid=diva2:1387724
https://link.springer.com/chapter/10.1007%2F978-3-030-36755-8_13
https://dblp.uni-trier.de/db/journals/logcom/logcom31.html#MahmoodMS21
https://academic.oup.com/logcom/article-abstract/31/1/266/6049828
https://doi.org/10.1093/logcom/exaa079

A Note on the Parameterised Complexity of Coverability in Vector Addition Systems

Autoři: Pilipczuk, Michał Schmitz, Sylvain Sinclair-Banks, Henry

Témata: Computational Complexity, Logic in Computer Science, F.2.2, D.2.4

Relation: http://arxiv.org/abs/2511.19212

Dostupnost: http://arxiv.org/abs/2511.19212

The Parameterised Complexity Of Integer Multicommodity Flow

Autoři: Sub Algorithms and Complexity Algorithms and Complexity Misra, Neeldhara a další

URL: https://doi.org/10.4230/LIPIcs.IPEC.2023.6
http://hdl.handle.net/1874/436469
https://dspace.library.uu.nl/handle/1874/436469
http://www.scopus.com/inward/record.url?scp=85180554765&partnerID=8YFLogxK
1868-8969
18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Leibniz International Proceedings in Informatics (LIPIcs)
285
91
109

Parameterised Complexity of Abduction in Schaefer’s Framework

Autoři: Mahmood, Y. Meier, A. Schmidt, Johannes

Témata: Abduction, Co-clones, Parameterised complexity, Schaefer’s framework, Algebra, Cloning, Cobalt compounds, Parameterization, Abductive reasoning, Algebraic approaches, Constraint Satisfaction, Fine-grained analysis, Reasoning problems, Constraint satisfaction problems, Computational Mathematics, Beräkningsmatematik, Conference paper, info:eu-repo/semantics/conferenceObject, text

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-47488
Lecture Notes in Computer Science, 0302-9743 ; 11972
Logical Foundations of Computer Science : International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020 Proceedings, p. 195-213

Parameterised complexity of model checking and satisfiability in propositional dependence logic

Autoři: Mahmood, Yasir Meier, Arne

Témata: Model checking, Parameterised complexity, Propositional dependence logic, Satisfiability, Article, Text

URL: https://www.repo.uni-hannover.de/handle/123456789/12926
https://doi.org/10.1007/s10472-021-09730-w
Annals of mathematics and artificial intelligence 90 (2022), Nr. 2-3
1573-7470
https://doi.org/10.1007/s10472-021-09730-w

Cost-optimal and Net-benefit Planning: A Parameterised Complexity View

Autoři: Aghighi, Meysam Bäckström, Christer

Zdroj: 24th International Joint Conference on Artificial Intelligence (IJCAI-15). :1487-1493

Popis souboru: electronic

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-128181
https://liu.diva-portal.org/smash/get/diva2:929808/FULLTEXT01.pdf

Parameterised Complexity of Propositional Inclusion and Independence Logic

Autoři: Mahmood, Yasir Virtema, Jonni

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer Science - Computational Complexity, 0102 computer and information sciences, 0101 mathematics, Computational Complexity (cs.CC), 01 natural sciences, Logic in Computer Science (cs.LO)

Přístupová URL adresa: http://arxiv.org/abs/2105.14887

The parameterised complexity of list problems on graphs of bounded treewidth

Autoři: Meeks, Kitty Scott, Alexander

Zdroj: Information and Computation. 251:91-103

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 16. Peace & justice, 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1110.4077
https://eprints.gla.ac.uk/122505/7/122505.pdf
https://people.maths.ox.ac.uk/scott/Papers/treewidthlist.pdf
http://dblp.uni-trier.de/db/journals/corr/corr1110.html#abs-1110-4077
http://eprints.gla.ac.uk/122505/
https://www.sciencedirect.com/science/article/pii/S0890540116300542
https://dblp.uni-trier.de/db/journals/iandc/iandc251.html#MeeksS16
https://www.sciencedirect.com/science/article/abs/pii/S0890540116300542

A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms

Autoři: Corus, D. Lehre, P. Neumann, F. a další

Zdroj: Evolutionary Computation. 24:183-203

Témata: combinatorial optimisation, FOS: Computer and information sciences, Bi-level optimisation, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Neural and Evolutionary Computing, Systems Theory, Neural and Evolutionary Computing (cs.NE), 02 engineering and technology, evolutionary algorithms, Biological Evolution, Algorithms

Popis souboru: application/pdf

Přístupová URL adresa: http://eprints.whiterose.ac.uk/120163/1/1401.1905v1.pdf
https://pubmed.ncbi.nlm.nih.gov/25700147
http://arxiv.org/abs/1401.1905
https://eprints.whiterose.ac.uk/120163/1/1401.1905v1.pdf
https://research.birmingham.ac.uk/portal/en/publications/a-parameterised-complexity-analysis-of-bilevel-optimisation-with-evolutionary-algorithms(f19c7602-d4b9-4016-a4ab-0a4bc312d10f).html
https://eprints.whiterose.ac.uk/120163/
https://www.ncbi.nlm.nih.gov/pubmed/25700147
https://dl.acm.org/citation.cfm?id=2937680
http://cognet.mit.edu/journal/10.1162/EVCO_a_00147
https://ieeexplore.ieee.org/document/7432131/

On the Parameterised Complexity of Induced Multipartite Graph Parameters

Autoři: Mann, Ryan L. Mathieson, Luke Greenhill, Catherine

Zdroj: Mann, R L, Mathieson, L & Greenhill, C 2020, ' On the Parameterised Complexity of Induced Multipartite Graph Parameters ', arXiv . < https://arxiv.org/abs/2004.09938 >

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2004.09938
https://research-information.bris.ac.uk/ws/files/235941929/2004.09938v1.pdf
https://hdl.handle.net/1983/bfd6f245-648a-4309-af3a-73994d6acf4b

The parameterised complexity of counting even and odd induced subgraphs

Autoři: Jerrum, Mark Meeks, Kitty

Zdroj: Combinatorica. 37:965-990

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Discrete Mathematics (cs.DM), 8. Economic growth, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0102 computer and information sciences, Computational Complexity (cs.CC), 0101 mathematics, 16. Peace & justice, 01 natural sciences, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://eprints.gla.ac.uk/111146/7/111146.pdf
http://arxiv.org/abs/1410.3375
https://eprints.gla.ac.uk/111146/7/111146.pdf
https://link.springer.com/content/pdf/10.1007%2Fs00493-016-3338-5.pdf
https://core.ac.uk/display/77042715
https://arxiv.org/abs/1410.3375
https://link.springer.com/article/10.1007%2Fs00493-016-3338-5
http://eprints.gla.ac.uk/111146/
https://dblp.uni-trier.de/db/journals/corr/corr1410.html#JerrumM14