• Suche: "parameterized complexity"

Treffer 41 - 60 von 5.288

41

Hedonic seat arrangement problems
Bodlaender, Hans L. ; Hanaka, Tesshu ; Jaffke, Lars ; et al.
Autonomous Agents and Multi-Agent Systems. 39(2)

Fachzeitschrift
Zu den Favoriten
42

On Algorithmic Applications of ℱ-Branchwidth
Bergougnoux, Benjamin ; Hamm, Thekla ; Jaffke, Lars ; et al.
European Symposium on Algorithms (ESA), Sep 2025, Varsovie, Poland. ⟨10.4230/LIPIcs.ESA.2025.16⟩

Varsovie, Poland DN logic Independent Set ETH Theory of computation →... Mathematics of computing... …
Konferenz
Zu den Favoriten
43

On Maximum 2-Clubs
Dumont, Joanne ; Lampis, Michael ; Liedloff, Mathieu ; et al.
IPEC 2025, Sep 2025, Warsaw, Poland. ⟨10.4230/LIPIcs.IPEC.2025.13⟩

Warsaw, Poland parameterized algorithms Theory of computation →... SETH chordal graphs 2-clubs …
Konferenz
Zu den Favoriten
44

Broadcasting Under Structural Restrictions
Egami, Yudai ; Gima, Tatsuya ; Hanaka, Tesshu ; et al.

Varsovie, Poland Theory of computation Telephone Broadcast Structural Graph Paramet... Parameterized Complexity [INFO]Computer Science [...
Konferenz
Zu den Favoriten
45

The Complexity of Homomorphism Reconstructibility
Jan Böker ; Louis Härtel ; Nina Runde ; et al.
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)

FOS: Computer and inform... Mathematics of computing... Discrete Mathematics (cs... Theory of computation →... graph homomorphism parameterised complexity …
Fachzeitschrift
Zu den Favoriten
46

Mim-Width Is paraNP-Complete
Bergougnoux, Benjamin ; Bonnet, Édouard ; Duron, Julien ; et al.
LIPIcs. 334(LIPIcs, Volume 334, ICALP 2025, Complete Volume)

Aarhus, Denmark Theory of computation →... reductions and completen... Theory of computation →... ordered graphs parameterized complexity …
Konferenz
Zu den Favoriten
47

Parameterizing Path Partitions
Fernau, Henning ; Foucaud, Florent ; Mann, Kevin ; et al.
Theoretical Computer Science. 1028:115029-115029

Path Partitions NP-hardn... Path Partitions NP-hardness Parameterized Complexity Neighborhood Diversity Directed Neighborhood Di... …
Zeitschrift
Zu den Favoriten
48

Maximum-utility Popular Matchings with Bounded Instability: Maximum-utility popular matchings with bounded instability
Ildikó Schlotter ; Ágnes Cseh
ACM Transactions on Computation Theory. 17:1-35

FOS: Computer and inform... Matching models Discrete Mathematics (cs... stable matching 0211 other engineering a... Parameterized complexity... …
Fachzeitschrift
Zu den Favoriten
49

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set: Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set
Daniel Lokshtanov ; Maadapuzhi-Sridharan Ramanujan ; Saket Saurabh ; et al.
ACM Transactions on Computation Theory. 17:1-28

Graph theory (including... polynomial kernel treewidth Parameterized complexity... important separator directed feedback vertex...
Fachzeitschrift
Zu den Favoriten
50

An Efficient Algorithm for Power Dominating Set
Bläsius, Thomas ; Göttlicher, Max ; Thomas Bläsius and Max Göttlicher
Algorithmica, 87 (3), 344–376

ddc:004 FOS: Computer and inform... F.2.2 G.2.2 DATA processing & comput... Reduction Rules …
Fachzeitschrift
Zu den Favoriten
51

Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
Bougeret, Marin ; Jansen, Bart, M P ; Sau, Ignasi ; et al.
SIAM Journal on Discrete Mathematics. 36(4):2737-2773

Vertex cover Parameterized complexity Polynomial kernel Structural parameterizat... Bridge-depth [MATH]Mathematics [math]
Zeitschrift
Zu den Favoriten
52

Eliminating Majority Illusion
Fioravantes, Foivos ; Lahiri, Abhiruk ; Lauerbach, Antonio ; et al.

Social netwoks Parameterized Complexity Approximation Algorithms [INFO.INFO-DM]Computer S... Discrete Mathematics [cs... [INFO.INFO-AI]Computer S... …
E-Ressource
Zu den Favoriten
53

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
Eiben, Eduard ; Ganian, Robert ; Kanj, Iyad ; et al.
Algorithmica. 88(1)

Fachzeitschrift
Zu den Favoriten
54

On the complexity of finding large odd induced subgraphs and odd colorings
Belmonte, Rémy ; Sau, Ignasi ; University of Electro-Communications [Tokyo] (UEC) ; et al.
WG 2020 - 46th International Workshop on Graph-Theoretic Concepts in Computer Science. :67-79

Leeds, United Kingdom odd subgraph odd coloring rank-width Parameterized complexity single-exponential algor... …
Konferenz
Zu den Favoriten
55

A parameterized point of view on forming small coalitions
Fioravantes, Foivos ; Gahlawat, Harmender ; Melissinos, Nikolaos ; et al.

Coalition formation Additive separable hedon... Parameterized complexity [INFO.INFO-CC]Computer S... Computational Complexity... [INFO.INFO-DM]Computer S... …
E-Ressource
Zu den Favoriten
56

Counting Subgraphs in Somewhere Dense Graphs
Marco Bressan ; Leslie Ann Goldberg ; Kitty Meeks ; et al.
SIAM Journal on Computing. 53:1409-1438

0301 basic medicine FOS: Computer and inform... parameterised complexity... counting problems Discrete Mathematics (cs... 0102 computer and inform... …
Fachzeitschrift
Zu den Favoriten
57

Structural Parameterizations for Two Bounded Degree Problems Revisited
Michael Lampis ; Manolis Vasilakis ; Michael Lampis and Manolis Vasilakis
ACM Transactions on Computation Theory. 16:1-51

FOS: Computer and inform... 0211 other engineering a... 0102 computer and inform... 02 engineering and techn... Computational Complexity... 01 natural sciences …
Fachzeitschrift
Zu den Favoriten
58

On the Complexity of the Median and Closest Permutation Problems
Cunha, Luís, Felipe I. ; Sau, Ignasi ; Souza, Uéverton dos Santos ; et al.
WABI 2024 - 24th International Workshop on Algorithms in Bioinformatics. :2-2

Egham, Surrey, United Ki... Median problem Closest problem Genome rearrangements Parameterized complexity [INFO]Computer Science [... …
Konferenz
Zu den Favoriten
59

Algorithms and Complexity for Path Covers of Temporal DAGs
Chakraborty, Dibyayan ; Dailly, Antoine ; Foucaud, Florent ; et al.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). :38-38

Bratislava, Slovakia Temporal Graphs Dilworth’s Theorem DAGs Path Cover Temporally Disjoint Path... …
Konferenz
Zu den Favoriten
60

Practical Computation of Graph VC-Dimension
Coudert, David ; Csikós, Mónika ; Ducoffe, Guillaume ; et al.
SEA 2024 - Symposium on Experimental Algorithms. :20-20

Vienne, Austria VC-dimension Graphs Algorithm graph algorithm …
Konferenz
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter