Letteratura scientifica selezionata sul tema "Parameterized complexity algorithms"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al 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.
Articoli di riviste sul tema "Parameterized complexity algorithms"
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 completoTesi sul tema "Parameterized complexity algorithms"
Xia, Ge. "Parameterized algorithms and computational lower bounds: a structural approach". Texas A&M University, 2005. http://hdl.handle.net/1969.1/4322.
Testo completoKim, Eun Jung. "Parameterized algorithms on digraph and constraint satisfaction problems". Thesis, Royal Holloway, University of London, 2010. http://repository.royalholloway.ac.uk/items/4e3a1971-6e98-97a9-8e4f-9e1fdc76066a/9/.
Testo completoEnciso, Rosa. "Alliances in Graphs: Parameterized Algorithms and on Partitioning Series-Parallel Graphs". Doctoral diss., University of Central Florida, 2009. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2479.
Testo completoPh.D.
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Computer Science PhD
Dinh, Hiep. "Exploring Algorithms for Branch Decompositions of Planar Graphs". Ohio University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1222984625.
Testo completoZhang, Fenghui. "Effective algorithms and protocols for wireless networking: a topological approach". Diss., Texas A&M University, 2008. http://hdl.handle.net/1969.1/86012.
Testo completoChan, Hubert. "A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs". Thesis, University of Waterloo, 2003. http://hdl.handle.net/10012/1090.
Testo completoCadena, Jose Eduardo. "Finding Interesting Subgraphs with Guarantees". Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/81960.
Testo completoPh. D.
Sau, Ignasi. "Optimization in Graphs under Degree Constraints. Application to Telecommunication Networks". Phd thesis, Université de Nice Sophia-Antipolis, 2009. http://tel.archives-ouvertes.fr/tel-00429092.
Testo completoDaligault, Jean. "Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe". Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2011. http://tel.archives-ouvertes.fr/tel-00804206.
Testo completoChopin, Morgan. "Problèmes d'optimisation avec propagation dans les graphes : complexité paramétrée et approximation". Phd thesis, Université Paris Dauphine - Paris IX, 2013. http://tel.archives-ouvertes.fr/tel-00933769.
Testo completoLibri sul tema "Parameterized complexity algorithms"
IWPEC 2004 (2004 Bergen, Norway). Parameterized and exact computation: First international workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004 : proceedings. Berlin: Springer, 2004.
Cerca il testo completoM, Grohe, e Niedermeier Rolf, a cura di. Parameterized and exact computation: Third international workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008 : proceedings. Berlin: Springer, 2008.
Cerca il testo completoRaman, V. Parameterized and Exact Computation: 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.
Cerca il testo completoJ, Woeginger Gerhard, e SpringerLink (Online service), a cura di. Parameterized and Exact Computation: 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Cerca il testo completoIWPEC 2009 (2009 Copenhagen, Denmark). Parameterized and exact computation: 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009 : revised selected papers. Berlin: Springer, 2009.
Cerca il testo completoPeter, Rossmanith, e SpringerLink (Online service), a cura di. Parameterized and Exact Computation: 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Cerca il testo completoParameterized Complexity Theory. Springer, 2010.
Cerca il testo completoFlum, J., e M. Grohe. Parameterized Complexity Theory. Springer, 2006.
Cerca il testo completoRosamond, Frances, Neeldhara Misra e Meirav Zehavi, a cura di. New Frontiers in Parameterized Complexity and Algorithms. MDPI, 2024. http://dx.doi.org/10.3390/books978-3-7258-1302-5.
Testo completoParameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer, 2006.
Cerca il testo completoCapitoli di libri sul tema "Parameterized complexity algorithms"
Golovach, Petr A., Marcin Kamiński, Spyridon Maniatis e Dimitrios M. Thilikos. "The Parameterized Complexity of Graph Cyclability". In Algorithms - ESA 2014, 492–504. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44777-2_41.
Testo completoBazgan, Cristina, Morgan Chopin e Michael R. Fellows. "Parameterized Complexity of the Firefighter Problem". In Algorithms and Computation, 643–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25591-5_66.
Testo completoCooper, Alexandre, Stephanie Maaz, Amer E. Mouawad e Naomi Nishimura. "Parameterized Complexity of Reconfiguration of Atoms". In WALCOM: Algorithms and Computation, 263–74. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96731-4_22.
Testo completoAravind, N. R., e Roopam Saxena. "Parameterized Complexity of Path Set Packing". In WALCOM: Algorithms and Computation, 291–302. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-27051-2_25.
Testo completoPanolan, Fahad, e Saket Saurabh. "Matroids in Parameterized Complexity and Exact Algorithms". In Encyclopedia of Algorithms, 1203–6. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_783.
Testo completoDörnfelder, Martin, Jiong Guo, Christian Komusiewicz e Mathias Weller. "On the Parameterized Complexity of Consensus Clustering". In Algorithms and Computation, 624–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25591-5_64.
Testo completoPanolan, Fahad, e Saket Saurabh. "Matroids in Parameterized Complexity and Exact Algorithms". In Encyclopedia of Algorithms, 1–4. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_783-1.
Testo completoDey, Palash, Arnab Maiti e Amatya Sharma. "On Parameterized Complexity of Liquid Democracy". In Algorithms and Discrete Applied Mathematics, 83–94. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67899-9_7.
Testo completoLiu, Yunlong, Jianxin Wang, Jiong Guo e Jianer Chen. "Cograph Editing: Complexity and Parameterized Algorithms". In Lecture Notes in Computer Science, 110–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22685-4_10.
Testo completoAgrawal, Akanksha, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha e Vijayaragunathan Ramamoorthi. "Parameterized Complexity of Minimum Membership Dominating Set". In WALCOM: Algorithms and Computation, 288–99. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96731-4_24.
Testo completoAtti di convegni sul tema "Parameterized complexity algorithms"
Neumann, Frank, e Andrew M. Sutton. "Parameterized Complexity Analysis of Evolutionary Algorithms". In GECCO '15: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2739482.2756562.
Testo completoNeumann, Frank, e Andrew M. Sutton. "Parameterized complexity analysis of evolutionary algorithms". In GECCO '14: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2598394.2605351.
Testo completoLin, Bingkai. "The Parameterized Complexity of k-Biclique". In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973730.41.
Testo completoMaiti, Arnab, e Palash Dey. "Parameterized Algorithms for Kidney Exchange". In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/58.
Testo completoDeligkas, Argyrios, Eduard Eiben, Robert Ganian, Thekla Hamm e Sebastian Ordyniak. "The Parameterized Complexity of Connected Fair Division". In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/20.
Testo completoGrüttemeier, Niels, Christian Komusiewicz e Nils Morawietz. "On the Parameterized Complexity of Polytree Learning". In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/580.
Testo completoDeligkas, Argyrios, Eduard Eiben e Tiger-Lily Goldsmith. "Parameterized Complexity of Hotelling-Downs with Party Nominees". In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/35.
Testo completoSilva, Janio Carlos Nascimento, Uéverton dos Santos Souza e Luiz Satoru Ochi. "Algorithmic Aspects of Problems Related to Optimization, Circuits, and Parameterized Complexity". In Concurso de Teses e Dissertações. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/ctd.2022.223305.
Testo completoBliznets, Ivan, Marek Cygan, Pawel Komosa, Lukáš Mach e Michał Pilipczuk. "Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems". In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611974331.ch79.
Testo completoArrighi, Emmanuel, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira e Petra Wolf. "Diversity in Kemeny Rank Aggregation: A Parameterized Approach". In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/2.
Testo completo