Journal articles on the topic 'Parameterized complexity algorithms'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Parameterized complexity algorithms.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
Marx, D. "Parameterized Complexity and Approximation Algorithms." Computer Journal 51, no. 1 (March 6, 2007): 60–78. http://dx.doi.org/10.1093/comjnl/bxm048.
Dabrowski, Konrad K., Peter Jonsson, Sebastian Ordyniak, and George Osipov. "Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 4 (June 28, 2022): 3724–32. http://dx.doi.org/10.1609/aaai.v36i4.20286.
Liu, Yunlong, Jianxin Wang, Jiong Guo, and Jianer Chen. "Complexity and parameterized algorithms for Cograph Editing." Theoretical Computer Science 461 (November 2012): 45–54. http://dx.doi.org/10.1016/j.tcs.2011.11.040.
Gasarch, W., and K. M. Kin. "Invitation to Fixed-Parameter Algorithms * Parameterized Complexity Theory * Parameterized Algorithmics: Theory, Practice and Prospects." Computer Journal 51, no. 1 (March 6, 2007): 137–40. http://dx.doi.org/10.1093/comjnl/bxm047.
Bulteau, Laurent, and Mathias Weller. "Parameterized Algorithms in Bioinformatics: An Overview." Algorithms 12, no. 12 (December 1, 2019): 256. http://dx.doi.org/10.3390/a12120256.
Kellerhals, Leon, Tomohiro Koana, Pascal Kunz, and Rolf Niedermeier. "Parameterized Algorithms for Colored Clustering." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 4 (June 26, 2023): 4400–4408. http://dx.doi.org/10.1609/aaai.v37i4.25560.
Blažej, Václav, Robert Ganian, Dušan Knop, Jan Pokorný, Šimon Schierreich, and Kirill Simonov. "The Parameterized Complexity of Network Microaggregation." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 5 (June 26, 2023): 6262–70. http://dx.doi.org/10.1609/aaai.v37i5.25771.
Fichte, Johannes K., Markus Hecher, and Arne Meier. "Counting Complexity for Reasoning in Abstract Argumentation." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2827–34. http://dx.doi.org/10.1609/aaai.v33i01.33012827.
Eiben, Eduard, Robert Ganian, Thekla Hamm, and Viktoriia Korchemna. "A Structural Complexity Analysis of Synchronous Dynamical Systems." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 5 (June 26, 2023): 6313–21. http://dx.doi.org/10.1609/aaai.v37i5.25777.
Feldmann, Andreas Emil, Karthik C. Karthik C. S., Euiwoong Lee, and Pasin Manurangsi. "A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms." Algorithms 13, no. 6 (June 19, 2020): 146. http://dx.doi.org/10.3390/a13060146.
Fichte, Johannes. "Backdoors to Tractability of Answer-Set Programming." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 29, 2013): 1662–63. http://dx.doi.org/10.1609/aaai.v27i1.8505.
Bannach, Max, and Till Tantau. "On the Descriptive Complexity of Color Coding." Algorithms 14, no. 3 (March 19, 2021): 96. http://dx.doi.org/10.3390/a14030096.
Lee, Chuan-Min. "Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective." Mathematics 11, no. 15 (July 28, 2023): 3325. http://dx.doi.org/10.3390/math11153325.
XIE, MINZHU, JIAN'ER CHEN, and JIANXIN WANG. "RESEARCH ON PARAMETERIZED ALGORITHMS OF THE INDIVIDUAL HAPLOTYPING PROBLEM." Journal of Bioinformatics and Computational Biology 05, no. 03 (June 2007): 795–816. http://dx.doi.org/10.1142/s0219720007002710.
Chen, Jianer, and Iyad A. Kanj. "Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms." Journal of Computer and System Sciences 67, no. 4 (December 2003): 833–47. http://dx.doi.org/10.1016/j.jcss.2003.09.003.
Golovach, Petr A., and Dimitrios M. Thilikos. "Paths of bounded length and their cuts: Parameterized complexity and algorithms." Discrete Optimization 8, no. 1 (February 2011): 72–86. http://dx.doi.org/10.1016/j.disopt.2010.09.009.
Crespelle, Christophe, Pål Grønås Drange, Fedor V. Fomin, and Petr Golovach. "A survey of parameterized algorithms and the complexity of edge modification." Computer Science Review 48 (May 2023): 100556. http://dx.doi.org/10.1016/j.cosrev.2023.100556.
Tao, Liangde, Lin Chen, and Guochuan Zhang. "Scheduling Stochastic Jobs - Complexity and Approximation Algorithms." Proceedings of the International Conference on Automated Planning and Scheduling 31 (May 17, 2021): 367–75. http://dx.doi.org/10.1609/icaps.v31i1.15982.
Sato, T., and Y. Kameya. "Parameter Learning of Logic Programs for Symbolic-Statistical Modeling." Journal of Artificial Intelligence Research 15 (December 1, 2001): 391–454. http://dx.doi.org/10.1613/jair.912.
Wiersema, Roeland, Dylan Lewis, David Wierichs, Juan Carrasquilla, and Nathan Killoran. "Here comes the SU(N): multivariate quantum gates and gradients." Quantum 8 (March 7, 2024): 1275. http://dx.doi.org/10.22331/q-2024-03-07-1275.
Lin, Mugang, Jianxin Wang, Qilong Feng, and Bin Fu. "Randomized Parameterized Algorithms for the Kidney Exchange Problem." Algorithms 12, no. 2 (February 25, 2019): 50. http://dx.doi.org/10.3390/a12020050.
Kanj, Iyad A., Luay Nakhleh, and Ge Xia. "The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms." Algorithmica 51, no. 2 (October 9, 2007): 99–128. http://dx.doi.org/10.1007/s00453-007-9046-1.
Eiben, Eduard, Fedor Fomin, Fahad Panolan, and Kirill Simonov. "Manipulating Districts to Win Elections: Fine-Grained Complexity." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 02 (April 3, 2020): 1902–9. http://dx.doi.org/10.1609/aaai.v34i02.5559.
Green, Frederic. "The Book Review Column1." ACM SIGACT News 51, no. 4 (December 14, 2020): 4–5. http://dx.doi.org/10.1145/3444815.3444817.
Roayaei, Mehdy, and MohammadReza Razzazi. "Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs." International Journal of Foundations of Computer Science 29, no. 07 (November 2018): 1215–30. http://dx.doi.org/10.1142/s0129054118500302.
Bredereck, Robert, Piotr Faliszewski, Andrzej Kaczmarczyk, Dušan Knop, and Rolf Niedermeier. "Parameterized Algorithms for Finding a Collective Set of Items." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 02 (April 3, 2020): 1838–45. http://dx.doi.org/10.1609/aaai.v34i02.5551.
Eiben, Eduard, Robert Ganian, Thekla Hamm, and Sebastian Ordyniak. "Parameterized Complexity of Envy-Free Resource Allocation in Social Networks." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 05 (April 3, 2020): 7135–42. http://dx.doi.org/10.1609/aaai.v34i05.6201.
Boudjellal, Nawel, Hayet Roumili, and Djamel Benterki. "Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function." Boletim da Sociedade Paranaense de Matemática 40 (February 2, 2022): 1–16. http://dx.doi.org/10.5269/bspm.47772.
Bruchertseifer, Jens, and Henning Fernau. "Synchronizing series-parallel deterministic finite automata with loops and related problems." RAIRO - Theoretical Informatics and Applications 55 (2021): 7. http://dx.doi.org/10.1051/ita/2021005.
Misra, Neeldhara, Frances Rosamond, and Meirav Zehavi. "Special Issue “New Frontiers in Parameterized Complexity and Algorithms”: Foreward by the Guest Editors." Algorithms 13, no. 9 (September 18, 2020): 236. http://dx.doi.org/10.3390/a13090236.
Chitnis, Rajesh, Andreas Emil Feldmann, and Pasin Manurangsi. "Parameterized Approximation Algorithms for Bidirected Steiner Network Problems." ACM Transactions on Algorithms 17, no. 2 (June 2021): 1–68. http://dx.doi.org/10.1145/3447584.
Kowaluk, Mirosław, and Andrzej Lingas. "A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms." Algorithms 15, no. 12 (November 28, 2022): 448. http://dx.doi.org/10.3390/a15120448.
Eiben, Eduard, Robert Ganian, Dusan Knop, and Sebastian Ordyniak. "Solving Integer Quadratic Programming via Explicit and Structural Restrictions." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 1477–84. http://dx.doi.org/10.1609/aaai.v33i01.33011477.
STEWART, IAIN A. "ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES." Parallel Processing Letters 22, no. 01 (March 2012): 1250003. http://dx.doi.org/10.1142/s012962641250003x.
Gaspers, Serge, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, and Stefan Szeider. "On Finding Optimal Polytrees." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 750–56. http://dx.doi.org/10.1609/aaai.v26i1.8217.
Elkabbany, Ghada Farouk, Hassan Ibrahim Ahmed, Heba K. Aslan, Young-Im Cho, and Mohamed S. Abdallah. "Lightweight Computational Complexity Stepping up the NTRU Post-Quantum Algorithm Using Parallel Computing." Symmetry 16, no. 1 (December 21, 2023): 12. http://dx.doi.org/10.3390/sym16010012.
Abu-Khzam, Faisal N., and Karam Al Kontar. "A Brief Survey of Fixed-Parameter Parallelism." Algorithms 13, no. 8 (August 14, 2020): 197. http://dx.doi.org/10.3390/a13080197.
Faran, Rachel, and Orna Kupferman. "A Parametrized Analysis of Algorithms on Hierarchical Graphs." International Journal of Foundations of Computer Science 30, no. 06n07 (September 2019): 979–1003. http://dx.doi.org/10.1142/s0129054119400252.
Cohen, Liron, Adham Jabarin, Andrei Popescu, and Reuben N. S. Rowe. "The Complex(ity) Landscape of Checking Infinite Descent." Proceedings of the ACM on Programming Languages 8, POPL (January 5, 2024): 1352–84. http://dx.doi.org/10.1145/3632888.
Jonsson, Peter, Victor Lagerkvist, and Biman Roy. "Fine-Grained Time Complexity of Constraint Satisfaction Problems." ACM Transactions on Computation Theory 13, no. 1 (March 2021): 1–32. http://dx.doi.org/10.1145/3434387.
Pourhassan, Mojgan, Feng Shi, and Frank Neumann. "Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem." Evolutionary Computation 27, no. 4 (December 2019): 559–75. http://dx.doi.org/10.1162/evco_a_00255.
Fomin, Fedor V., Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi. "Multiplicative Parameterization Above a Guarantee." ACM Transactions on Computation Theory 13, no. 3 (September 30, 2021): 1–16. http://dx.doi.org/10.1145/3460956.
Gaspers, Serge, and Kamran Najeebullah. "Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 533–40. http://dx.doi.org/10.1609/aaai.v33i01.3301533.
Cygan, Marek, Jesper Nederlof, Marcin Pilipczuk, Michał Pilipczuk, Johan M. M. Van Rooij, and Jakub Onufry Wojtaszczyk. "Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time." ACM Transactions on Algorithms 18, no. 2 (April 30, 2022): 1–31. http://dx.doi.org/10.1145/3506707.
Chini, Peter, Roland Meyer, and Prakash Saivasan. "Fine-Grained Complexity of Safety Verification." Journal of Automated Reasoning 64, no. 7 (July 14, 2020): 1419–44. http://dx.doi.org/10.1007/s10817-020-09572-x.
Bredereck, Robert, Piotr Faliszewski, Rolf Niedermeier, and Nimrod Talmon. "Large-Scale Election Campaigns: Combinatorial Shift Bribery." Journal of Artificial Intelligence Research 55 (March 16, 2016): 603–52. http://dx.doi.org/10.1613/jair.4927.
Philip, Aby, Soorya Rethinasamy, Vincent Russo, and Mark M. Wilde. "Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering." Quantum 8 (June 11, 2024): 1366. http://dx.doi.org/10.22331/q-2024-06-11-1366.
Şeker, Oylum, Pinar Heggernes, Tinaz Ekim, and Z. Caner Taşkın. "Generation of random chordal graphs using subtrees of a tree." RAIRO - Operations Research 56, no. 2 (March 2022): 565–82. http://dx.doi.org/10.1051/ro/2022027.
Baste, Julien, Lars Jaffke, Tomáš Masařík, Geevarghese Philip, and Günter Rote. "FPT Algorithms for Diverse Collections of Hitting Sets." Algorithms 12, no. 12 (November 27, 2019): 254. http://dx.doi.org/10.3390/a12120254.
De Oliveira Oliveira, Mateus, and Farhad Vadiee. "From Width-Based Model Checking to Width-Based Automated Theorem Proving." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 5 (June 26, 2023): 6297–304. http://dx.doi.org/10.1609/aaai.v37i5.25775.