Articoli di riviste sul tema "Parameterized complexity algorithms"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 articoli di riviste per l'attività di ricerca sul tema "Parameterized complexity algorithms".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi gli articoli di riviste di molte aree scientifiche e compila una bibliografia corretta.
Marx, D. "Parameterized Complexity and Approximation Algorithms". Computer Journal 51, n. 1 (6 marzo 2007): 60–78. http://dx.doi.org/10.1093/comjnl/bxm048.
Testo completoDabrowski, Konrad K., Peter Jonsson, Sebastian Ordyniak e George Osipov. "Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach". Proceedings of the AAAI Conference on Artificial Intelligence 36, n. 4 (28 giugno 2022): 3724–32. http://dx.doi.org/10.1609/aaai.v36i4.20286.
Testo completoLiu, Yunlong, Jianxin Wang, Jiong Guo e Jianer Chen. "Complexity and parameterized algorithms for Cograph Editing". Theoretical Computer Science 461 (novembre 2012): 45–54. http://dx.doi.org/10.1016/j.tcs.2011.11.040.
Testo completoGasarch, W., e K. M. Kin. "Invitation to Fixed-Parameter Algorithms * Parameterized Complexity Theory * Parameterized Algorithmics: Theory, Practice and Prospects". Computer Journal 51, n. 1 (6 marzo 2007): 137–40. http://dx.doi.org/10.1093/comjnl/bxm047.
Testo completoBulteau, Laurent, e Mathias Weller. "Parameterized Algorithms in Bioinformatics: An Overview". Algorithms 12, n. 12 (1 dicembre 2019): 256. http://dx.doi.org/10.3390/a12120256.
Testo completoKellerhals, Leon, Tomohiro Koana, Pascal Kunz e Rolf Niedermeier. "Parameterized Algorithms for Colored Clustering". Proceedings of the AAAI Conference on Artificial Intelligence 37, n. 4 (26 giugno 2023): 4400–4408. http://dx.doi.org/10.1609/aaai.v37i4.25560.
Testo completoBlažej, Václav, Robert Ganian, Dušan Knop, Jan Pokorný, Šimon Schierreich e Kirill Simonov. "The Parameterized Complexity of Network Microaggregation". Proceedings of the AAAI Conference on Artificial Intelligence 37, n. 5 (26 giugno 2023): 6262–70. http://dx.doi.org/10.1609/aaai.v37i5.25771.
Testo completoFichte, Johannes K., Markus Hecher e Arne Meier. "Counting Complexity for Reasoning in Abstract Argumentation". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 luglio 2019): 2827–34. http://dx.doi.org/10.1609/aaai.v33i01.33012827.
Testo completoEiben, Eduard, Robert Ganian, Thekla Hamm e Viktoriia Korchemna. "A Structural Complexity Analysis of Synchronous Dynamical Systems". Proceedings of the AAAI Conference on Artificial Intelligence 37, n. 5 (26 giugno 2023): 6313–21. http://dx.doi.org/10.1609/aaai.v37i5.25777.
Testo completoFeldmann, Andreas Emil, Karthik C. Karthik C. S., Euiwoong Lee e Pasin Manurangsi. "A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms". Algorithms 13, n. 6 (19 giugno 2020): 146. http://dx.doi.org/10.3390/a13060146.
Testo completoFichte, Johannes. "Backdoors to Tractability of Answer-Set Programming". Proceedings of the AAAI Conference on Artificial Intelligence 27, n. 1 (29 giugno 2013): 1662–63. http://dx.doi.org/10.1609/aaai.v27i1.8505.
Testo completoBannach, Max, e Till Tantau. "On the Descriptive Complexity of Color Coding". Algorithms 14, n. 3 (19 marzo 2021): 96. http://dx.doi.org/10.3390/a14030096.
Testo completoLee, Chuan-Min. "Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective". Mathematics 11, n. 15 (28 luglio 2023): 3325. http://dx.doi.org/10.3390/math11153325.
Testo completoXIE, MINZHU, JIAN'ER CHEN e JIANXIN WANG. "RESEARCH ON PARAMETERIZED ALGORITHMS OF THE INDIVIDUAL HAPLOTYPING PROBLEM". Journal of Bioinformatics and Computational Biology 05, n. 03 (giugno 2007): 795–816. http://dx.doi.org/10.1142/s0219720007002710.
Testo completoChen, Jianer, e Iyad A. Kanj. "Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms". Journal of Computer and System Sciences 67, n. 4 (dicembre 2003): 833–47. http://dx.doi.org/10.1016/j.jcss.2003.09.003.
Testo completoGolovach, Petr A., e Dimitrios M. Thilikos. "Paths of bounded length and their cuts: Parameterized complexity and algorithms". Discrete Optimization 8, n. 1 (febbraio 2011): 72–86. http://dx.doi.org/10.1016/j.disopt.2010.09.009.
Testo completoCrespelle, Christophe, Pål Grønås Drange, Fedor V. Fomin e Petr Golovach. "A survey of parameterized algorithms and the complexity of edge modification". Computer Science Review 48 (maggio 2023): 100556. http://dx.doi.org/10.1016/j.cosrev.2023.100556.
Testo completoTao, Liangde, Lin Chen e Guochuan Zhang. "Scheduling Stochastic Jobs - Complexity and Approximation Algorithms". Proceedings of the International Conference on Automated Planning and Scheduling 31 (17 maggio 2021): 367–75. http://dx.doi.org/10.1609/icaps.v31i1.15982.
Testo completoSato, T., e Y. Kameya. "Parameter Learning of Logic Programs for Symbolic-Statistical Modeling". Journal of Artificial Intelligence Research 15 (1 dicembre 2001): 391–454. http://dx.doi.org/10.1613/jair.912.
Testo completoWiersema, Roeland, Dylan Lewis, David Wierichs, Juan Carrasquilla e Nathan Killoran. "Here comes the SU(N): multivariate quantum gates and gradients". Quantum 8 (7 marzo 2024): 1275. http://dx.doi.org/10.22331/q-2024-03-07-1275.
Testo completoLin, Mugang, Jianxin Wang, Qilong Feng e Bin Fu. "Randomized Parameterized Algorithms for the Kidney Exchange Problem". Algorithms 12, n. 2 (25 febbraio 2019): 50. http://dx.doi.org/10.3390/a12020050.
Testo completoKanj, Iyad A., Luay Nakhleh e Ge Xia. "The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms". Algorithmica 51, n. 2 (9 ottobre 2007): 99–128. http://dx.doi.org/10.1007/s00453-007-9046-1.
Testo completoEiben, Eduard, Fedor Fomin, Fahad Panolan e Kirill Simonov. "Manipulating Districts to Win Elections: Fine-Grained Complexity". Proceedings of the AAAI Conference on Artificial Intelligence 34, n. 02 (3 aprile 2020): 1902–9. http://dx.doi.org/10.1609/aaai.v34i02.5559.
Testo completoGreen, Frederic. "The Book Review Column1". ACM SIGACT News 51, n. 4 (14 dicembre 2020): 4–5. http://dx.doi.org/10.1145/3444815.3444817.
Testo completoRoayaei, Mehdy, e MohammadReza Razzazi. "Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs". International Journal of Foundations of Computer Science 29, n. 07 (novembre 2018): 1215–30. http://dx.doi.org/10.1142/s0129054118500302.
Testo completoBredereck, Robert, Piotr Faliszewski, Andrzej Kaczmarczyk, Dušan Knop e Rolf Niedermeier. "Parameterized Algorithms for Finding a Collective Set of Items". Proceedings of the AAAI Conference on Artificial Intelligence 34, n. 02 (3 aprile 2020): 1838–45. http://dx.doi.org/10.1609/aaai.v34i02.5551.
Testo completoEiben, Eduard, Robert Ganian, Thekla Hamm e Sebastian Ordyniak. "Parameterized Complexity of Envy-Free Resource Allocation in Social Networks". Proceedings of the AAAI Conference on Artificial Intelligence 34, n. 05 (3 aprile 2020): 7135–42. http://dx.doi.org/10.1609/aaai.v34i05.6201.
Testo completoBoudjellal, Nawel, Hayet Roumili e 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 (2 febbraio 2022): 1–16. http://dx.doi.org/10.5269/bspm.47772.
Testo completoBruchertseifer, Jens, e 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.
Testo completoMisra, Neeldhara, Frances Rosamond e Meirav Zehavi. "Special Issue “New Frontiers in Parameterized Complexity and Algorithms”: Foreward by the Guest Editors". Algorithms 13, n. 9 (18 settembre 2020): 236. http://dx.doi.org/10.3390/a13090236.
Testo completoChitnis, Rajesh, Andreas Emil Feldmann e Pasin Manurangsi. "Parameterized Approximation Algorithms for Bidirected Steiner Network Problems". ACM Transactions on Algorithms 17, n. 2 (giugno 2021): 1–68. http://dx.doi.org/10.1145/3447584.
Testo completoKowaluk, Mirosław, e Andrzej Lingas. "A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms". Algorithms 15, n. 12 (28 novembre 2022): 448. http://dx.doi.org/10.3390/a15120448.
Testo completoEiben, Eduard, Robert Ganian, Dusan Knop e Sebastian Ordyniak. "Solving Integer Quadratic Programming via Explicit and Structural Restrictions". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 luglio 2019): 1477–84. http://dx.doi.org/10.1609/aaai.v33i01.33011477.
Testo completoSTEWART, IAIN A. "ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES". Parallel Processing Letters 22, n. 01 (marzo 2012): 1250003. http://dx.doi.org/10.1142/s012962641250003x.
Testo completoGaspers, Serge, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak e Stefan Szeider. "On Finding Optimal Polytrees". Proceedings of the AAAI Conference on Artificial Intelligence 26, n. 1 (20 settembre 2021): 750–56. http://dx.doi.org/10.1609/aaai.v26i1.8217.
Testo completoElkabbany, Ghada Farouk, Hassan Ibrahim Ahmed, Heba K. Aslan, Young-Im Cho e Mohamed S. Abdallah. "Lightweight Computational Complexity Stepping up the NTRU Post-Quantum Algorithm Using Parallel Computing". Symmetry 16, n. 1 (21 dicembre 2023): 12. http://dx.doi.org/10.3390/sym16010012.
Testo completoAbu-Khzam, Faisal N., e Karam Al Kontar. "A Brief Survey of Fixed-Parameter Parallelism". Algorithms 13, n. 8 (14 agosto 2020): 197. http://dx.doi.org/10.3390/a13080197.
Testo completoFaran, Rachel, e Orna Kupferman. "A Parametrized Analysis of Algorithms on Hierarchical Graphs". International Journal of Foundations of Computer Science 30, n. 06n07 (settembre 2019): 979–1003. http://dx.doi.org/10.1142/s0129054119400252.
Testo completoCohen, Liron, Adham Jabarin, Andrei Popescu e Reuben N. S. Rowe. "The Complex(ity) Landscape of Checking Infinite Descent". Proceedings of the ACM on Programming Languages 8, POPL (5 gennaio 2024): 1352–84. http://dx.doi.org/10.1145/3632888.
Testo completoJonsson, Peter, Victor Lagerkvist e Biman Roy. "Fine-Grained Time Complexity of Constraint Satisfaction Problems". ACM Transactions on Computation Theory 13, n. 1 (marzo 2021): 1–32. http://dx.doi.org/10.1145/3434387.
Testo completoPourhassan, Mojgan, Feng Shi e Frank Neumann. "Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem". Evolutionary Computation 27, n. 4 (dicembre 2019): 559–75. http://dx.doi.org/10.1162/evco_a_00255.
Testo completoFomin, Fedor V., Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh e Meirav Zehavi. "Multiplicative Parameterization Above a Guarantee". ACM Transactions on Computation Theory 13, n. 3 (30 settembre 2021): 1–16. http://dx.doi.org/10.1145/3460956.
Testo completoGaspers, Serge, e Kamran Najeebullah. "Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 luglio 2019): 533–40. http://dx.doi.org/10.1609/aaai.v33i01.3301533.
Testo completoCygan, Marek, Jesper Nederlof, Marcin Pilipczuk, Michał Pilipczuk, Johan M. M. Van Rooij e Jakub Onufry Wojtaszczyk. "Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time". ACM Transactions on Algorithms 18, n. 2 (30 aprile 2022): 1–31. http://dx.doi.org/10.1145/3506707.
Testo completoChini, Peter, Roland Meyer e Prakash Saivasan. "Fine-Grained Complexity of Safety Verification". Journal of Automated Reasoning 64, n. 7 (14 luglio 2020): 1419–44. http://dx.doi.org/10.1007/s10817-020-09572-x.
Testo completoBredereck, Robert, Piotr Faliszewski, Rolf Niedermeier e Nimrod Talmon. "Large-Scale Election Campaigns: Combinatorial Shift Bribery". Journal of Artificial Intelligence Research 55 (16 marzo 2016): 603–52. http://dx.doi.org/10.1613/jair.4927.
Testo completoPhilip, Aby, Soorya Rethinasamy, Vincent Russo e Mark M. Wilde. "Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering". Quantum 8 (11 giugno 2024): 1366. http://dx.doi.org/10.22331/q-2024-06-11-1366.
Testo completoŞeker, Oylum, Pinar Heggernes, Tinaz Ekim e Z. Caner Taşkın. "Generation of random chordal graphs using subtrees of a tree". RAIRO - Operations Research 56, n. 2 (marzo 2022): 565–82. http://dx.doi.org/10.1051/ro/2022027.
Testo completoBaste, Julien, Lars Jaffke, Tomáš Masařík, Geevarghese Philip e Günter Rote. "FPT Algorithms for Diverse Collections of Hitting Sets". Algorithms 12, n. 12 (27 novembre 2019): 254. http://dx.doi.org/10.3390/a12120254.
Testo completoDe Oliveira Oliveira, Mateus, e Farhad Vadiee. "From Width-Based Model Checking to Width-Based Automated Theorem Proving". Proceedings of the AAAI Conference on Artificial Intelligence 37, n. 5 (26 giugno 2023): 6297–304. http://dx.doi.org/10.1609/aaai.v37i5.25775.
Testo completo