Search Results - "parameterized algorithm"

Dividing splittable goods evenly and with limited fragmentation

Authors: Damaschke, Peter, 1963

Source: Algorithmica. 82(5):1298-1328

Subject Terms: Approximation algorithm, Parameterized algorithm, Fair division, Weighted graph, Linear-time algorithm

File Description: electronic

Access URL: https://research.chalmers.se/publication/513743
https://research.chalmers.se/publication/513743/file/513743_Fulltext.pdf

Matching and Edge Cover in Temporal Graphs

Authors: Cioni, Lapo Dondi, Riccardo Marino, Andrea et al.

Contributors: Cioni, Lapo Dondi, Riccardo Marino, Andrea et al.

Subject Terms: graphs, FOS: Computer and information sciences, Computer Science - Computational Complexity, temporal graphs, parameterized algorithm, matching, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Computational Complexity (cs.CC), edge cover, approximation algorithm

File Description: application/pdf

Access URL: http://arxiv.org/abs/2504.06762
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.8

Parameterized mixed graph coloring

Authors: Damaschke, Peter, 1963

Source: Journal of Combinatorial Optimization. 38(2):362-374

Subject Terms: longest path, parameterized algorithm, graph coloring, scheduling, mixed graph

File Description: electronic

Access URL: https://research.chalmers.se/publication/511193
https://research.chalmers.se/publication/508680
https://research.chalmers.se/publication/511193/file/511193_Fulltext.pdf

A Polynomial Kernel for Funnel Arc Deletion Set

Authors: Marcelo Garlet Milani

Contributors: Marcelo Garlet Milani

Source: Algorithmica. 84:2358-2378

Subject Terms: FOS: Computer and information sciences, funnels, parameterized algorithm, Computer Science - Data Structures and Algorithms, directed feedback arc set, graph editing, Data Structures and Algorithms (cs.DS), 510 Mathematik, ddc:510, ddc:004, kernels

File Description: application/pdf

Access URL: http://arxiv.org/abs/1911.05520
https://drops.dagstuhl.de/opus/volltexte/2020/13316/pdf/LIPIcs-IPEC-2020-13.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr1911.html#abs-1911-05520
https://arxiv.org/abs/1911.05520
http://arxiv.org/pdf/1911.05520.pdf
https://drops.dagstuhl.de/opus/volltexte/2020/13316/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.13
https://depositonce.tu-berlin.de/handle/11303/17054

Fpt Approximation for Capacitated Sum of Radii

Authors: Jaiswal, Ragesh Kumar, Amit Yadav, Jatin et al.

Contributors: Jaiswal, Ragesh Kumar, Amit Yadav, Jatin et al.

Subject Terms: parameterized algorithm, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, ddc:004, Approximation algorithm, 01 natural sciences, clustering

File Description: application/pdf

Access URL: http://arxiv.org/abs/2401.06714
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.65

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs

Authors: An, Shinwoo Oh, Eunjin Shinwoo An and Eunjin Oh

Contributors: An, Shinwoo Oh, Eunjin Shinwoo An and Eunjin Oh

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Unit disk graphs, tree decomposition, parameterized algorithm, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, cycle packing

File Description: application/pdf

Access URL: http://arxiv.org/abs/2403.11426
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.7

The PACE 2024 parameterized algorithms and computational experiments challenge: one-sided crossing minimization: One-Sided Crossing Minimization

Authors: Kindermann, Philipp Klute, Fabian Maximilian Terziadis, Soeren et al.

Contributors: Kindermann, Philipp Klute, Fabian Maximilian Terziadis, Soeren et al.

Source: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Subject Terms: Àrees temàtiques de la UPC::Matemàtiques i estadística, One-Sided Crossing Minimization, FPT, Crossing minimization, One-sided crossing minimization, Algorithm Engineering, Parameterization, Heuristic, Optimization algorithms, Parameterized problems, Parameterized algorithm, Heuristics, Heuristic algorithms, ddc:004, Computational experiment, Consensus algorithm, Algorithm engineering, Exact algorithms, Minimization problems, Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.26
https://hdl.handle.net/2117/422322
https://research.tue.nl/en/publications/the-pace-2024-parameterized-algorithms-and-computational-experime
https://doi.org/10.4230/lipics.ipec.2024.26

Finding and enumerating large intersections

Authors: Damaschke, Peter, 1963

Source: Theoretical Computer Science. 580:75-82

Subject Terms: intersection, disjoint sets, family of sets, parameterized algorithm, enumeration

File Description: electronic

Access URL: https://research.chalmers.se/publication/215359
http://dx.doi.org/10.1016/j.tcs.2015.02.034

Voting and Bribing in Single-Exponential Time

Authors: Knop, Dusan Koutecký, Martin Mnich, Matthias et al.

Contributors: Knop, Dusan Koutecký, Martin Mnich, Matthias et al.

Source: ACM Transactions on Economics and Computation. 8:1-28

Subject Terms: FOS: Computer and information sciences, parameterized algorithm, swap bribery, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, Voting system, Computer Science - Data Structures and Algorithms, Parameterized algorithm, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, n-fold integer programming, integer programming

File Description: application/pdf

Access URL: https://dl.acm.org/doi/pdf/10.1145/3396855
http://arxiv.org/abs/1812.01852
https://cris.maastrichtuniversity.nl/en/publications/c6ca15b9-1d93-484f-b83d-6c0c97e6ac6c
https://doi.org/10.4230/LIPIcs.STACS.2017.46
https://drops.dagstuhl.de/opus/volltexte/2017/6988/pdf/LIPIcs-STACS-2017-46.pdf/
https://drops.dagstuhl.de/opus/volltexte/2017/6988/
http://dblp.uni-trier.de/db/conf/stacs/stacs2017.html#KnopKM17
https://dblp.uni-trier.de/db/conf/stacs/stacs2017.html#KnopKM17
https://arxiv.org/abs/1812.01852
https://arxiv.org/pdf/1812.01852
https://cris.maastrichtuniversity.nl/portal/en/publications/voting-and-bribing-in-singleexponential-time(c6ca15b9-1d93-484f-b83d-6c0c97e6ac6c).html
https://doi.org/10.1145/3396855
https://arxiv.org/abs/1812.01852
https://dblp.uni-trier.de/db/journals/corr/corr1812.html#abs-1812-01852
http://ui.adsabs.harvard.edu/abs/2018arXiv181201852K/abstract
https://arxiv.org/pdf/1812.01852.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.46

Cluster Editing with Overlapping Communities

Authors: Arrighi, Emmanuel Bentert, Matthias Drange, Pål Grønås et al.

Contributors: Arrighi, Emmanuel Bentert, Matthias Drange, Pål Grønås et al.

Source: Leibniz International Proceedings in Informatics
2:1-2:12

Subject Terms: correlation clustering, vertex splitting, parameterized algorithm, graph modification, NP-hardness, ddc:004

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.2
https://hdl.handle.net/11250/3144250

Algorithms for comparing large pedigree graphs

Authors: Nahla A. Belal Lamiaa A. Amar Hany H. Sherief

Source: Advances in Computing and Engineering, Vol 2, Iss 1, Pp 43-59 (2022)

Subject Terms: pedigree graphs, isomorphism, parameterized algorithm, kernelization algorithms, Electronic computers. Computer science, QA75.5-76.95, Technology (General), T1-995, Computer engineering. Computer hardware, TK7885-7895

File Description: electronic resource

Relation: http://apc.aast.edu/ojs/index.php/ACE/article/view/474; https://doaj.org/toc/2735-5977; https://doaj.org/toc/2735-5985

Access URL: https://doaj.org/article/b11f665b22fa4c1dbb1d548cc54a2fdf

Parameterized Algorithms and Kernels for Rainbow Matching

Authors: Sushmita Gupta Sanjukta Roy Saket Saurabh et al.

Contributors: Sushmita Gupta Sanjukta Roy Saket Saurabh et al.

Source: Algorithmica. 81:1684-1698

Subject Terms: Rainbow Matching, 3-Set Packing, Bounded Search Trees, Parameterized Algorithm, Divide-and-Conquer, 3-Dimensional Matching, 0102 computer and information sciences, ddc:004, 01 natural sciences

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/opus/volltexte/2017/8124/pdf/LIPIcs-MFCS-2017-71.pdf
https://drops.dagstuhl.de/opus/volltexte/2017/8124/
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2017.html#GuptaR0Z17
https://doi.org/10.4230/LIPIcs.MFCS.2017.71
https://drops.dagstuhl.de/opus/volltexte/2017/8124/pdf/LIPIcs-MFCS-2017-71.pdf/
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica81.html#GuptaRSZ19
https://link.springer.com/article/10.1007%2Fs00453-018-0497-3
https://link.springer.com/content/pdf/10.1007/s00453-018-0497-3.pdf
https://doi.org/10.1007/s00453-018-0497-3
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.71

Block Elimination Distance

Authors: Diner, Ö.Y. Giannopoulou, A.C. Stamoulis, G. et al.

Subject Terms: Biconnected graphs, Elimination distance, Graph minors, Obstructions, Parameterized algorithms, Graph theory, Parameter estimation, Biconnected graph, Class A, Class B, Class G, Graph class, Non-trivial, Obstruction, Parameterized algorithm, Graphic methods

File Description: application/pdf

Relation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı; https://hdl.handle.net/20.500.12469/4757; 28; 38; 12911 LNCS

Availability: https://hdl.handle.net/20.500.12469/4757
https://doi.org/10.1007/978-3-030-86838-3_3

Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity

Authors: Cslovjecsek, Jana Eisenbrand, Friedrich Pilipczuk, Michał et al.

Contributors: Cslovjecsek, Jana Eisenbrand, Friedrich Pilipczuk, Michał et al.

Source: Leibniz International Proceedings in Informatics (LIPIcs), 204 ; 29th Annual European Symposium on Algorithms (ESA 2021)

Subject Terms: Parameterized algorithm, Multistage stochastic programming, Proximity

File Description: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-204-4; http://hdl.handle.net/20.500.11850/507027

Availability: https://hdl.handle.net/20.500.11850/507027
https://doi.org/10.3929/ethz-b-000507027

Feedback Vertex Set on Geometric Intersection Graphs

Authors: An, Shinwoo Oh, Eunjin Shinwoo An and Eunjin Oh

Contributors: An, Shinwoo Oh, Eunjin Shinwoo An and Eunjin Oh

Subject Terms: Feedback vertex set, intersection graphs, parameterized algorithm

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.47

Availability: https://doi.org/10.4230/LIPIcs.ISAAC.2021.47
https://nbn-resolving.org/urn:nbn:de:0030-drops-154807
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.47

Block Elimination Distance

Authors: Diner, Oznur Yasar Giannopoulou, Archontia C. Stamoulis, Giannos et al.

Source: Lecture Notes in Computer Science ISBN: 9783030868376

Subject Terms: Elimination distance, Obstructions, 05C75, 05C83, 05C75, 05C69, Block elimination distance, G.2.2, 0102 computer and information sciences, 01 natural sciences, Graph class, Parameterized algorithms, Non-trivial, Minor obstructions, Obstruction, Computer Science - Data Structures and Algorithms, Parameter estimation, Mathematics - Combinatorics, 0101 mathematics, Biconnected graph, Biconnected graphs, Graph minors, Graph theory, Graphic methods, Parameterized algorithm, Class B, Class A, F.2.2, Class G, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/pdf/2103.01872
http://arxiv.org/abs/2103.01872
https://dblp.uni-trier.de/db/journals/corr/corr2103.html#abs-2103-01872
https://link.springer.com/chapter/10.1007/978-3-030-86838-3_3
https://rd.springer.com/chapter/10.1007/978-3-030-86838-3_3
https://pergamos.lib.uoa.gr/uoa/dl/object/3346184
https://pergamos.lib.uoa.gr/uoa/dl/object/3063236
https://hdl.handle.net/20.500.12469/4757
https://hdl.handle.net/20.500.12469/5534

Faster Treewidth-based Approximations for Wiener Index

Authors: Conrado, Giovanna, K Goharshady, Amir, K Hudec, Pavel et al.

Contributors: Conrado, Giovanna, K Goharshady, Amir, K Hudec, Pavel et al.

Source: https://hal.science/hal-04327333 ; 2023.

Subject Terms: Computational Chemistry, Wiener Index, Parameterized Algorithm, Approximation Algorithm, Treewidth, Centroid Decomposition, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [CHIM.CHEM]Chemical Sciences/Cheminformatics

Relation: hal-04327333; https://hal.science/hal-04327333; https://hal.science/hal-04327333/document; https://hal.science/hal-04327333/file/main.pdf

Availability: https://hal.science/hal-04327333
https://hal.science/hal-04327333/document
https://hal.science/hal-04327333/file/main.pdf

A Survey on the k -Path Vertex Cover Problem

Authors: Jianhua Tu

Source: Axioms, Vol 11, Iss 191, p 191 (2022)

Subject Terms: k -path vertex cover problem, k -path vertex cover number, exact algorithm, approximation algorithm, parameterized algorithm, Mathematics, QA1-939

Relation: https://www.mdpi.com/2075-1680/11/5/191; https://doaj.org/toc/2075-1680; https://doaj.org/article/a2553d7d195c461d9a1ba30b3059549f

Availability: https://doi.org/10.3390/axioms11050191
https://doaj.org/article/a2553d7d195c461d9a1ba30b3059549f

A polynomial kernel for funnel arc deletion set

Authors: Milani, Marcelo Garlet

Subject Terms: 510 Mathematik, graph editing, directed feedback arc set, parameterized algorithm, kernels, funnels

File Description: application/pdf

Availability: https://depositonce.tu-berlin.de/handle/11303/17054
https://doi.org/10.14279/depositonce-15833

On the Maximum Weight Minimal Separator

Authors: Tesshu Hanaka Hans L. Bodlaender Hirotaka Ono et al.

Contributors: Tesshu Hanaka Hans L. Bodlaender Hirotaka Ono et al.

Source: Lecture Notes in Computer Science ISBN: 9783319559100

Subject Terms: General Computer Science, Treewidth, 0102 computer and information sciences, 02 engineering and technology, FILL-IN, 16. Peace & justice, 01 natural sciences, 6. Clean water, Theoretical Computer Science, Taverne, Parameterized algorithm, 0202 electrical engineering, electronic engineering, information engineering, Minimal separator, TREEWIDTH

File Description: application/pdf

Access URL: https://research.tue.nl/en/publications/9342de12-7af0-464d-ae38-9177171cfe32
https://doi.org/10.1016/j.tcs.2019.09.025
https://cris.maastrichtuniversity.nl/en/publications/863cd47e-3211-4b9d-bea6-50479e297148
https://doi.org/10.1016/j.tcs.2019.09.025
https://research-portal.uu.nl/en/publications/7ee57b51-a959-4d09-86cc-6fbab124c7eb
https://doi.org/10.1007/978-3-319-55911-7_22
http://dspace.library.uu.nl/handle/1874/390155
https://dblp.uni-trier.de/db/journals/tcs/tcs796.html#HanakaBZO19
https://www.sciencedirect.com/science/article/abs/pii/S0304397519305766
https://www.narcis.nl/publication/RecordID/oai%3Adspace.library.uu.nl%3A1874%2F390155
https://research.tue.nl/nl/publications/on-the-maximum-weight-minimal-separator-2
https://doi.org/10.1016/j.tcs.2019.09.025
https://research.tue.nl/nl/publications/on-the-maximum-weight-minimal-separator
https://rd.springer.com/chapter/10.1007/978-3-319-55911-7_22
https://link.springer.com/chapter/10.1007%2F978-3-319-55911-7_22
http://dspace.library.uu.nl/handle/1874/360583
https://dblp.uni-trier.de/db/conf/tamc/tamc2017.html#HanakaBZO17
https://www.narcis.nl/publication/RecordID/oai%3Adspace.library.uu.nl%3A1874%2F360583
https://dspace.library.uu.nl/handle/1874/390155
https://dspace.library.uu.nl/handle/1874/360583