Search Results - "fixed-parameter tractable algorithms"

Fixed parameter tractable algorithms for watchman route related problems on line segment arrangements

Authors: Remi Raman Shahin John J S R. Subashini et al.

Source: International Journal of Computer Mathematics: Computer Systems Theory. 9:131-138

Fixed-Parameter Tractable Algorithms for Rejection-Proof Kidney Exchange

Authors: Lamme, Jeroen S.K.

Index Terms: Master

URL: https://pure.tue.nl/ws/files/351955360/Lamme_J.pdf
https://pure.tue.nl/ws/files/351955360/Lamme_J.pdf

Fixed-Parameter Tractable Algorithms on Directed Graphs using H-Treewidth

Authors: Gorissen, Bart J.M.

Index Terms: Master

URL: https://pure.tue.nl/ws/files/350971700/Gorissen_B.pdf
https://pure.tue.nl/ws/files/350971700/Gorissen_B.pdf

Fixed-parameter tractable algorithms for Tracking Shortest Paths

Authors: Aritra Banik Pratibha Choudhary Venkatesh Raman et al.

Source: Theoretical Computer Science. 846:1-13

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: http://arxiv.org/pdf/2001.08977
http://arxiv.org/abs/2001.08977
https://jglobal.jst.go.jp/detail?JGLOBAL_ID=202002290799526426
https://ui.adsabs.harvard.edu/abs/2020arXiv200108977B/abstract
https://www.sciencedirect.com/science/article/abs/pii/S0304397520305053
http://dblp.uni-trier.de/db/journals/corr/corr2001.html#abs-2001-08977
https://doi.org/10.1016/j.tcs.2020.09.006
https://dblp.uni-trier.de/db/journals/corr/corr2001.html#abs-2001-08977

Fixed Parameter Tractable Algorithms for Watchman Route Related Problems on Rectilinear Line Segment Arrangements

Authors: Remi Raman Shahin John J S Subashini R et al.

Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions

Authors: Mahankali, Arvind V. Woodruff, David P. Zhang, Ziyu et al.

Contributors: Mahankali, Arvind V. Woodruff, David P. Zhang, Ziyu et al.

Subject Terms: FOS: Computer and information sciences, Computer Science - Machine Learning, Tensor decomposition, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Low rank approximation, Sketching algorithms, Machine Learning (cs.LG)

File Description: application/pdf

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

Fixed-Parameter Tractable Algorithms for Refined Parameterizations of Graph Problems

Authors: van Roozendaal, Tom

Index Terms: Master, Master

URL: https://pure.tue.nl/ws/files/305626964/Roozendaal_T.pdf
https://pure.tue.nl/ws/files/305626964/Roozendaal_T.pdf

Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons

Authors: Sharma, Vidya Sagar

Index Terms: Computer Science - Data Structures and Algorithms, text

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

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases: complexity, approximation and fixed parameter tractable algorithms, and some special cases

Authors: Weller, Mathias Chateau, Annie Dallard, Clément et al.

Contributors: Weller, Mathias Chateau, Annie Dallard, Clément et al.

Source: Weller, M, Chateau, A, Dallard, C & Giroudeau, R 2018, ' Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases ', Algorithmica, vol. 80 . https://doi.org/10.1007/s00453-018-0405-x

Subject Terms: 0301 basic medicine, 0303 health sciences, 03 medical and health sciences, kernel, graph theory, scaffolding, bioinformatics, complexity, lower bound, {ISK4,wheel}-free graph, approximation, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

File Description: application/pdf; text/url

Access URL: https://hal.archives-ouvertes.fr/hal-01833303/file/hal_version.pdf
https://core.ac.uk/display/151190348
https://hal.archives-ouvertes.fr/hal-01833303
https://researchportal.port.ac.uk/en/publications/scaffolding-problems-revisited-complexity-approximation-and-fixed
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica80.html#WellerCDG18
https://researchportal.port.ac.uk/portal/files/8690655/algorithmica.pdf
https://hal.archives-ouvertes.fr/hal-01833303/document
https://hal.science/hal-01833303v1
https://hal.science/hal-01833303v1/document
https://doi.org/10.1007/s00453-018-0405-x
https://researchportal.port.ac.uk/portal/en/publications/scaffolding-problems-revisited-complexity-approximation-and-fixed-parameter-tractable-algorithms-and-some-special-cases(e2b21b71-f616-42ba-a3f2-809766b5c645).html
https://repozitorij.upr.si/IzpisGradiva.php?id=12404
https://doi.org/10.1007/s00453-018-0405-x
https://hdl.handle.net/20.500.12556/RUP-12404

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs

Authors: Pradeesha Ashok Saket Saurabh Sudeshna Kolay et al.

Source: SIAM Journal on Discrete Mathematics. 32:1189-1208

Subject Terms: Maximization algorithms, Conflict-free coloring, 0102 computer and information sciences, FPT algorithms, 01 natural sciences, Unique-maximum coloring

Access URL: https://pure.tue.nl/ws/files/102167270/16m1107462.pdf
https://dblp.uni-trier.de/db/journals/siamdm/siamdm32.html#AshokDKS18
https://doi.org/10.1137/16M1107462
https://epubs.siam.org/doi/10.1137/16M1107462
https://locus.siam.org/doi/abs/10.1137/16M1107462

Fixed-parameter tractable algorithms in graph theory

Authors: Soleimanfallah, Arezou

Subject Terms: 511

Access URL: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531326

Fixed-Parameter Tractable Algorithms for Optimal Layout Decomposition and Beyond

Authors: Jian Kuang Evangeline F. Y. Young

Source: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 38:1731-1743

Subject Terms: 2. Zero hunger, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: https://dl.acm.org/doi/pdf/10.1145/3061639.3062250
https://doi.org/10.1145/3061639.3062250
https://dblp.uni-trier.de/db/conf/dac/dac2017.html#0001Y17
https://dblp.uni-trier.de/db/journals/tcad/tcad38.html#KuangY19
https://doi.org/10.1109/TCAD.2018.2859255
https://ieeexplore.ieee.org/document/8418782

Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions

Authors: Mahankali, Arvind V. Woodruff, David P. Zhang, Ziyu et al.

Contributors: Mahankali, Arvind V. Woodruff, David P. Zhang, Ziyu et al.

Subject Terms: Low rank approximation, Sketching algorithms, Tensor decomposition

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.79

Availability: https://doi.org/10.4230/LIPIcs.ITCS.2024.79
https://nbn-resolving.org/urn:nbn:de:0030-drops-196078
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.79

Fixed-parameter tractable algorithms for Tracking Shortest Paths

Authors: Banik, Aritra Choudhary, Pratibha Raman, Venkatesh et al.

Index Terms: Computer Science - Data Structures and Algorithms, text

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

Fixed-Parameter Tractable Algorithms for Tracking Set Problems

Authors: Pratibha Choudhary Aritra Banik

Source: Lecture Notes in Computer Science ISBN: 9783319741796

Access URL: https://link.springer.com/chapter/10.1007/978-3-319-74180-2_8
https://link.springer.com/10.1007/978-3-319-74180-2_8
https://dblp.uni-trier.de/db/conf/caldam/caldam2018.html#BanikC18
https://rd.springer.com/chapter/10.1007/978-3-319-74180-2_8

Fixed-Parameter Tractable Algorithms for Corridor Guarding Problems

Authors: Raman, Remi Subashini, R Methirumangalath, Subhasree

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Computational Geometry, 0102 computer and information sciences, 01 natural sciences

Access URL: http://arxiv.org/abs/1902.03820

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

Authors: Fellows, M. R. Knauer, C. Nishimura, N. et al.

Contributors: Fellows, M. R. Knauer, C. Nishimura, N. et al.

Source: Lecture Notes in Computer Science ISBN: 9783540230250

Subject Terms: graph matching, 4. Education, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, fixed parameter tractable, set packing, 7. Clean energy, 01 natural sciences, parameterized complexity, color coding

Access URL: https://dblp.uni-trier.de/db/conf/esa/esa2004.html#FellowsKNRRSTW04
https://core.ac.uk/display/24721390

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover

Authors: Dimitrios M. Thilikos Naomi Nishimura Prabhakar Ragde

Source: Lecture Notes in Computer Science ISBN: 9783540424239

Subject Terms: Parameterized complexity, Graph algorithms (graph-theoretic aspects), Applied Mathematics, 0211 other engineering and technologies, parametrized complexity, Discrete Mathematics and Combinatorics, Graph minors, Structural characterization of families of graphs, 0102 computer and information sciences, 02 engineering and technology, graph minors, FPT algorithms, 01 natural sciences

File Description: application/xml

Access URL: http://users.uoa.gr/%7Esedthilk/papers/cover.pdf
https://link.springer.com/content/pdf/10.1007%2F3-540-44634-6_8.pdf
https://link.springer.com/chapter/10.1007%2F3-540-44634-6_8
https://core.ac.uk/display/81570750
https://dblp.uni-trier.de/db/conf/wads/wads2001.html#NishimuraRT01
https://link.springer.com/content/pdf/10.1007%2F3-540-44634-6_8.pdf
https://link.springer.com/chapter/10.1007/3-540-44634-6_8
https://www.sciencedirect.com/science/article/pii/S0166218X05001356#!
https://rd.springer.com/chapter/10.1007%2F3-540-44634-6_8
http://users.uoa.gr/~sedthilk/papers/cover.pdf
https://www.sciencedirect.com/science/article/pii/S0166218X05001356

Towards fixed-parameter tractable algorithms for abstract argumentation

Authors: Stefan Woltran Wolfgang Dvořák Reinhard Pichler

Source: Artificial Intelligence. 186:1-37

Subject Terms: Tree-width, Artificial Intelligence, Fixed-parameter tractability, 0202 electrical engineering, electronic engineering, information engineering, Complexity, 0102 computer and information sciences, 02 engineering and technology, Dynamic programming, Abstract argumentation, 01 natural sciences

TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY

Authors: Karol Lynch Patrick Healy

Source: International Journal of Foundations of Computer Science. 17:1095-1114

Subject Terms: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Access URL: https://www.worldscientific.com/doi/abs/10.1142/S0129054106004285
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs17.html#HealyL06
http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs17.html#HealyL06
https://doi.org/10.1142/S0129054106004285