Sökresultat - "parameterized complexity"

Parameterized Complexity for Query Subset Optimization

Dimri, Namya, Srivastava, Arunesh, Ananya, Malepati, Math, Sinchana, Venugopal, K, Kavitha, S N

2024 8th International Conference on Computational System and Information Technology for Sustainable Solutions (CSITSS)

Fair Repetitive Interval Scheduling

Heeger, Klaus^Aff1, Hermelin, Danny^Aff1, Itzhaki, Yuval^{Aff1, IDs0045302501322y_cor1}, Molter, Hendrik^Aff2, Shabtay, Dvir^Aff1

Bandwidth Parameterized by Cluster Vertex Deletion Number

Gima, Tatsuya, Kim, Eun Jung^{Aff2, Aff3, Aff4}, Köhler, Noleen^{Aff5, IDs0045302501315x_cor1}, Melissinos, Nikolaos, Vasilakis, Manolis

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem

Baguley, Samuel, Friedrich, Tobias, Neumann, Aneta, Neumann, Frank, Pappik, Marcus, Zeif, Ziena^{Aff1, IDs00453024012909_cor1}

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure

Bodlaender, Hans L., Groenland, Carla, Jacob, Hugo, Jaffke, Lars^{Aff3, Aff4, IDs00453024012749_cor1}, Lima, Paloma T.

An O(3.82k)FPT Time O(3.82k)FPT Algorithm for Convex Flip Distance

Li, Haohong, Xia, Ge^{Aff1, IDs00454023005969_cor1}

Trichotomous Votes Election with Graph Constraint

Wang, Fengbo, Zhou, Aizhong, Xu, Jianliang

2023 18th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)

Combinatorics in AI: Principles & Algorithms An Extended Abstract

Barr, Joseph R., Haass, Jon C, Shaw, Peter, Abu-Khzam, Faisal N.

2024 Conference on AI, Science, Engineering, and Technology (AIxSET)

Combinatorial Clustering of Coastal Contaminant Data an Extended Abstract

Abu-Khzam, Faisal, Kimbrough, Kimani, Barr, Joseph R.

2024 Conference on AI, Science, Engineering, and Technology (AIxSET)

An Efficient Algorithm for Power Dominating Set

Bläsius, Thomas, Göttlicher, Max^{Aff1, IDs00453024012838_cor1}

Complexity of scheduling few types of jobs on related and unrelated machines

Koutecký, Martin^{Aff1, IDs10951024008278_cor1}, Zink, Johannes^{Aff2, IDs10951024008278_cor2}

Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)

Marx, Dániel, Sankar, Govind S., Schepper, Philipp^{Aff1, IDs0045302401265w_cor1}

Parameterized Complexity of Disconnected Matchings

Gupta, Sushmita^Aff10, Jain, Pallavi^Aff11, Kanesh, Lawqueen^Aff13, Modak, Sounak^Aff10, Saurabh, Saket^{Aff10, Aff12}

Goos, Gerhard, Series Editor^{Aff1, Aff3}, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff4, Gao, Wen, Editorial Board Member^Aff5, Steffen, Bernhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Finocchi, Irene, editor^Aff8, Georgiadis, Loukas, editor^Aff9

Exact and Approximate High-Multiplicity Scheduling on Identical Machines

Jansen, Klaus^Aff10, Kahler, Kai^Aff10, Zwanger, Esther^Aff10

Goos, Gerhard, Series Editor^{Aff1, Aff3}, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff4, Gao, Wen, Editorial Board Member^Aff5, Steffen, Bernhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Finocchi, Irene, editor^Aff8, Georgiadis, Loukas, editor^Aff9

Structural Parameterization of Locating-Dominating Set and Test Cover

Chakraborty, Dipayan^{Aff10, Aff11, Aff12}, Foucaud, Florent^Aff10, Majumdar, Diptapriyo^Aff13, Tale, Prafullkumar^Aff14

Goos, Gerhard, Series Editor^{Aff1, Aff3}, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff4, Gao, Wen, Editorial Board Member^Aff5, Steffen, Bernhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Finocchi, Irene, editor^Aff8, Georgiadis, Loukas, editor^Aff9

Kernel for Proper Helly Circular-Arc Vertex Deletion: Smaller and Simpler via Graph Isomorphism

Yuan, Hanchun^Aff10, Zhang, Zhen^Aff11

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, Du, Donglei, editor^Aff7, Han, Lu, editor^Aff8, Xu, Dachuan, editor^Aff9

Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints

Bandopadhyay, Susobhan^Aff10, Banerjee, Suman^Aff11, Majumdar, Diptapriyo^Aff12, Panolan, Fahad^Aff13

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, Du, Donglei, editor^Aff7, Han, Lu, editor^Aff8, Xu, Dachuan, editor^Aff9

Parameterized Complexity of (d, r)-Domination via Modular Decomposition

Cordasco, Gennaro^Aff9, Gargano, Luisa^Aff10, Rescigno, Adele A.^Aff10

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, Nakano, Shin-ichi, editor^Aff7, Xiao, Mingyu, editor^Aff8

Proportionally Dense Subgraphs: Parameterized Hardness and Efficiently Solvable Cases

Baghirova, Narmina^Aff9, Castillon, Antoine^Aff10

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, Nakano, Shin-ichi, editor^Aff7, Xiao, Mingyu, editor^Aff8

Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules

Suga, Tatsuhiro^Aff9, Suzuki, Akira^Aff9, Tamura, Yuma^Aff9, Zhou, Xiao^Aff9

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, Nakano, Shin-ichi, editor^Aff7, Xiao, Mingyu, editor^Aff8