Search Results - fixed parameter algorithms
-
1
Authors: et al.
Source: Journal of Graph Algorithms and Applications. 28:131-150
Subject Terms: 0102 computer and information sciences, 01 natural sciences
-
2
Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs.
Authors:
Source: Discrete Applied Mathematics. Oct2025, Vol. 373, p343-354. 12p.
Subject Terms: *REAL numbers, *GRAPH algorithms, *UNDIRECTED graphs, *SPARSE graphs, *INTEGERS, *WEIGHTED graphs
-
3
Authors: Ishay Haviv
Source: SIAM Journal on Computing. 53:287-314
Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, 01 natural sciences
Access URL: http://arxiv.org/abs/2204.09009
-
4
Authors: et al.
Contributors: et al.
Source: Theory of Computing Systems. 67:89-124
Subject Terms: Unsplittable Flow Cover, fixed parameter algorithms, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, ddc:004, [INFO] Computer Science [cs], approximation algorithms, 01 natural sciences, approximation al- gorithms
File Description: application/pdf
Access URL: https://drops.dagstuhl.de/opus/volltexte/2020/11903/pdf/LIPIcs-STACS-2020-42.pdf
https://hal.science/hal-03587595v1
https://doi.org/10.4230/lipics.stacs.2020.42
https://hal.science/hal-03587595v1/document
https://link.springer.com/article/10.1007/s00224-021-10048-7
https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2F07d0abbe-3029-4af0-b7a5-5e4c427cbe08
https://research.vu.nl/en/publications/fixed -parameter -algorithms -for-unsplittable-flow-cover
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.42 -
5
Authors: et al.
Source: Algorithmica. 84:917-960
Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0206 medical engineering, Populations and Evolution (q-bio.PE), 0102 computer and information sciences, 02 engineering and technology, Fixed-parameter algorithms, 01 natural sciences, Phylogenetic networks, FOS: Biological sciences, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Hybridization number, Quantitative Biology - Populations and Evolution, 92D15 05C90 05C85 56R10, Computer Science - Discrete Mathematics
-
6
Authors: et al.
Source: Theoretical Computer Science. 852:172-184
Subject Terms: FOS: Computer and information sciences, COMPLEXITY, Fixed-parameter tractable, MAXIMUM CUT, 101011 Graphentheorie, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 102031 Theoretische Informatik, Weighted maximum cut, 101011 Graph theory, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), OPTIMIZATION, 1-planar graphs, APPROXIMATION
Access URL: http://arxiv.org/pdf/1812.03074
http://arxiv.org/abs/1812.03074
https://ui.adsabs.harvard.edu/abs/2018arXiv181203074D/abstract
https://doi.org/10.1016/j.tcs.2020.11.030
https://www.sciencedirect.com/science/article/pii/S0304397520306721
https://dblp.uni-trier.de/db/journals/corr/corr1812.html#abs-1812-03074 -
7
Authors: Manuel Lafond
Source: Journal of Combinatorial Optimization. 47
Subject Terms: graph algorithms, FOS: Computer and information sciences, kernelization, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), biclustering, Computer science, parameterized complexity
File Description: application/xml
Access URL: http://arxiv.org/abs/2410.13123
-
8
Authors: et al.
Contributors: et al.
Source: Information and Computation. 302:105261
Subject Terms: FOS: Computer and information sciences, Fairness, Parameterized Algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Hitting Set
File Description: application/pdf
-
9
Authors: et al.
Source: Proceedings of the AAAI Conference on Artificial Intelligence. 36:9360-9367
Subject Terms: FOS: Computer and information sciences, Artificial Intelligence (cs.AI), Computer Science - Computer Science and Game Theory, Computer Science - Artificial Intelligence, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences, Computer Science and Game Theory (cs.GT)
Access URL: http://arxiv.org/abs/2112.13175
-
10
Authors: et al.
Source: Theory of Computing Systems. 67:1241-1267
Subject Terms: streaming algorithms, Analysis of algorithms and problem complexity, FPT, Combinatorial Optimization and Complexity Theory, Constraint Satisfaction Problems, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Algorithmic Applications, 7. Clean energy, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), minor deletion problems, 0202 electrical engineering, electronic engineering, information engineering, Nonnumerical algorithms, Graph Algorithms, Computer science, vertex cover, subgraph deletion problems, Algorithm, Parameterized complexity, Computational Theory and Mathematics, Graph theory (including graph drawing) in computer science, Fixed-Parameter Algorithms, Computer Science, Physical Sciences, Graph Theory and Algorithms, Parameterized Complexity
File Description: application/xml
-
11
Authors: et al.
Contributors: et al.
Source: Journal of Computer and System Sciences. 97:121-146
Subject Terms: FOS: Computer and information sciences, fixed-parameter algorithms, Computer Science - Data Structures and Algorithms, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, Data Structures and Algorithms (cs.DS), distance-hereditary graphs, 0102 computer and information sciences, ddc:004, rank-width, 01 natural sciences
File Description: application/pdf; text
Access URL: https://drops.dagstuhl.de/opus/volltexte/2016/6448/pdf/LIPIcs-MFCS-2016-34.pdf
http://arxiv.org/abs/1604.06056
http://ui.adsabs.harvard.edu/abs/2016arXiv160406056E/abstract
https://arxiv.org/abs/1604.06056
https://dblp.uni-trier.de/db/journals/corr/corr1604.html#EibenGK16
https://www.muni.cz/vyzkum/publikace/1523837
https://www.sciencedirect.com/science/article/abs/pii/S0022000018306044
https://arxiv.org/pdf/1604.06056
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.34
https://eprints.sztaki.hu/9062/ -
12
Authors:
Contributors:
Source: Journal of Scheduling. 27:119-133
Subject Terms: Precedence constraints, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Fixed-parameter tractable algorithm, Typed task system
File Description: application/pdf
-
13
Authors:
Contributors:
Source: Discrete Applied Mathematics. 290:1-6
Subject Terms: maximum lateness, 0211 other engineering and technologies, makespan, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, parallel identical machines, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], parameterized complexity
File Description: application/pdf
-
14
-
15
Authors: et al.
Contributors: et al.
Source: Theoretical computer science, 2017, Vol.689, pp.67-95 [Peer Reviewed Journal]
Husfeldt, Thore & Kanj, Iyad (Eds.). (2015). 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). : Leibniz International Proceedings in Informatics, pp. 102-113, LIPIcs : Leibniz international proceedings in informatics(43)Subject Terms: FOS: Computer and information sciences, G.2.2, F.2.2, G.2.1, proper interval vertex del, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Longest path problem, 0202 electrical engineering, electronic engineering, information engineering, Proper interval vertex deletion set, fixed-parameter algorithm, preprocessing, Preprocessing, Data reduction, Polynomialtime algorithm, polynomial-time algorithm, longest path problem, Computer Science - Computational Complexity, Fixed-parameter algorithm, Interval graphs, data reduction, interval graphs, ddc:004
File Description: application/pdf
Access URL: http://arxiv.org/abs/1506.01652
https://www.sciencedirect.com/science/article/pii/S030439751730422X
https://dro.dur.ac.uk/21953/
https://doi.org/10.1016/j.tcs.2017.05.017
https://www.sciencedirect.com/science/article/abs/pii/S030439751730422X
https://core.ac.uk/display/83925076
https://dblp.uni-trier.de/db/journals/tcs/tcs689.html#GiannopoulouMN17
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.102 -
16
Authors: et al.
Source: Lecture Notes in Computer Science ISBN: 9783031492747
Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS)
Access URL: http://arxiv.org/abs/2308.10600
-
17
Authors: et al.
Source: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
ACM Transactions on Algorithms (TALG)Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences
File Description: application/pdf
-
18
Authors: et al.
Contributors: et al.
Source: Theoretical Computer Science. 959:113863
Subject Terms: FOS: Computer and information sciences, Combinatorial Reconfiguration, 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, ddc:004, Fixed Parameter Tractability, 01 natural sciences, Nondeterministic Constraint Logic
File Description: application/pdf
Access URL: http://arxiv.org/abs/2011.10385
https://hal.archives-ouvertes.fr/hal-03089890
https://doi.org/10.4230/LIPIcs.IPEC.2020.15
https://drops.dagstuhl.de/opus/volltexte/2020/13318/pdf/LIPIcs-IPEC-2020-15.pdf/
https://arxiv.org/abs/2011.10385
https://dblp.uni-trier.de/db/journals/corr/corr2011.html#abs-2011-10385
https://tohoku.pure.elsevier.com/en/publications/fixed -parameter -algorithms -for-graph-constraint-logic-2
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.15 -
19
-
20
Authors:
Contributors:
Subject Terms: Pinwheel Scheduling, Polynomial-time Solvability, Packing and Covering, Fixed Parameter Algorithms
File Description: application/pdf
Relation: Is Part Of LIPIcs, Volume 359, 36th International Symposium on Algorithms and Computation (ISAAC 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.47
Nájsť tento článok vo Web of Science 
Full Text Finder