Literatura académica sobre el tema "Parameterized complexity algorithms"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Parameterized complexity algorithms".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Parameterized complexity algorithms"
Marx, D. "Parameterized Complexity and Approximation Algorithms". Computer Journal 51, n.º 1 (6 de marzo de 2007): 60–78. http://dx.doi.org/10.1093/comjnl/bxm048.
Texto completoDabrowski, Konrad K., Peter Jonsson, Sebastian Ordyniak y George Osipov. "Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach". Proceedings of the AAAI Conference on Artificial Intelligence 36, n.º 4 (28 de junio de 2022): 3724–32. http://dx.doi.org/10.1609/aaai.v36i4.20286.
Texto completoLiu, Yunlong, Jianxin Wang, Jiong Guo y Jianer Chen. "Complexity and parameterized algorithms for Cograph Editing". Theoretical Computer Science 461 (noviembre de 2012): 45–54. http://dx.doi.org/10.1016/j.tcs.2011.11.040.
Texto completoGasarch, W. y K. M. Kin. "Invitation to Fixed-Parameter Algorithms * Parameterized Complexity Theory * Parameterized Algorithmics: Theory, Practice and Prospects". Computer Journal 51, n.º 1 (6 de marzo de 2007): 137–40. http://dx.doi.org/10.1093/comjnl/bxm047.
Texto completoBulteau, Laurent y Mathias Weller. "Parameterized Algorithms in Bioinformatics: An Overview". Algorithms 12, n.º 12 (1 de diciembre de 2019): 256. http://dx.doi.org/10.3390/a12120256.
Texto completoKellerhals, Leon, Tomohiro Koana, Pascal Kunz y Rolf Niedermeier. "Parameterized Algorithms for Colored Clustering". Proceedings of the AAAI Conference on Artificial Intelligence 37, n.º 4 (26 de junio de 2023): 4400–4408. http://dx.doi.org/10.1609/aaai.v37i4.25560.
Texto completoBlažej, Václav, Robert Ganian, Dušan Knop, Jan Pokorný, Šimon Schierreich y Kirill Simonov. "The Parameterized Complexity of Network Microaggregation". Proceedings of the AAAI Conference on Artificial Intelligence 37, n.º 5 (26 de junio de 2023): 6262–70. http://dx.doi.org/10.1609/aaai.v37i5.25771.
Texto completoFichte, Johannes K., Markus Hecher y Arne Meier. "Counting Complexity for Reasoning in Abstract Argumentation". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julio de 2019): 2827–34. http://dx.doi.org/10.1609/aaai.v33i01.33012827.
Texto completoEiben, Eduard, Robert Ganian, Thekla Hamm y Viktoriia Korchemna. "A Structural Complexity Analysis of Synchronous Dynamical Systems". Proceedings of the AAAI Conference on Artificial Intelligence 37, n.º 5 (26 de junio de 2023): 6313–21. http://dx.doi.org/10.1609/aaai.v37i5.25777.
Texto completoFeldmann, Andreas Emil, Karthik C. Karthik C. S., Euiwoong Lee y Pasin Manurangsi. "A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms". Algorithms 13, n.º 6 (19 de junio de 2020): 146. http://dx.doi.org/10.3390/a13060146.
Texto completoTesis sobre el 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.
Texto 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/.
Texto 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.
Texto 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.
Texto 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.
Texto completoChan, Hubert. "A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs". Thesis, University of Waterloo, 2003. http://hdl.handle.net/10012/1090.
Texto completoCadena, Jose Eduardo. "Finding Interesting Subgraphs with Guarantees". Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/81960.
Texto 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.
Texto 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.
Texto 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.
Texto completoLibros sobre el 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.
Buscar texto completoM, Grohe y Niedermeier Rolf, eds. Parameterized and exact computation: Third international workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008 : proceedings. Berlin: Springer, 2008.
Buscar texto completoRaman, V. Parameterized and Exact Computation: 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.
Buscar texto completoThilikos, Dimitrios M. Parameterized and Exact Computation: 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Buscar texto 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.
Buscar texto completoMarx, Daniel. 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.
Buscar texto completoParameterized Complexity Theory. Springer, 2010.
Buscar texto completoFlum, J. y M. Grohe. Parameterized Complexity Theory. Springer, 2006.
Buscar texto completoRosamond, Frances, Neeldhara Misra y Meirav Zehavi, eds. New Frontiers in Parameterized Complexity and Algorithms. MDPI, 2024. http://dx.doi.org/10.3390/books978-3-7258-1302-5.
Texto completoParameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer, 2006.
Buscar texto completoCapítulos de libros sobre el tema "Parameterized complexity algorithms"
Golovach, Petr A., Marcin Kamiński, Spyridon Maniatis y Dimitrios M. Thilikos. "The Parameterized Complexity of Graph Cyclability". En Algorithms - ESA 2014, 492–504. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44777-2_41.
Texto completoBazgan, Cristina, Morgan Chopin y Michael R. Fellows. "Parameterized Complexity of the Firefighter Problem". En Algorithms and Computation, 643–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25591-5_66.
Texto completoCooper, Alexandre, Stephanie Maaz, Amer E. Mouawad y Naomi Nishimura. "Parameterized Complexity of Reconfiguration of Atoms". En WALCOM: Algorithms and Computation, 263–74. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96731-4_22.
Texto completoAravind, N. R. y Roopam Saxena. "Parameterized Complexity of Path Set Packing". En WALCOM: Algorithms and Computation, 291–302. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-27051-2_25.
Texto completoPanolan, Fahad y Saket Saurabh. "Matroids in Parameterized Complexity and Exact Algorithms". En Encyclopedia of Algorithms, 1203–6. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_783.
Texto completoDörnfelder, Martin, Jiong Guo, Christian Komusiewicz y Mathias Weller. "On the Parameterized Complexity of Consensus Clustering". En Algorithms and Computation, 624–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25591-5_64.
Texto completoPanolan, Fahad y Saket Saurabh. "Matroids in Parameterized Complexity and Exact Algorithms". En Encyclopedia of Algorithms, 1–4. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_783-1.
Texto completoDey, Palash, Arnab Maiti y Amatya Sharma. "On Parameterized Complexity of Liquid Democracy". En Algorithms and Discrete Applied Mathematics, 83–94. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67899-9_7.
Texto completoLiu, Yunlong, Jianxin Wang, Jiong Guo y Jianer Chen. "Cograph Editing: Complexity and Parameterized Algorithms". En 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.
Texto completoAgrawal, Akanksha, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha y Vijayaragunathan Ramamoorthi. "Parameterized Complexity of Minimum Membership Dominating Set". En WALCOM: Algorithms and Computation, 288–99. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96731-4_24.
Texto completoActas de conferencias sobre el tema "Parameterized complexity algorithms"
Neumann, Frank y Andrew M. Sutton. "Parameterized Complexity Analysis of Evolutionary Algorithms". En GECCO '15: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2739482.2756562.
Texto completoNeumann, Frank y Andrew M. Sutton. "Parameterized complexity analysis of evolutionary algorithms". En GECCO '14: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2598394.2605351.
Texto completoLin, Bingkai. "The Parameterized Complexity of k-Biclique". En 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.
Texto completoMaiti, Arnab y Palash Dey. "Parameterized Algorithms for Kidney Exchange". En 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.
Texto completoDeligkas, Argyrios, Eduard Eiben, Robert Ganian, Thekla Hamm y Sebastian Ordyniak. "The Parameterized Complexity of Connected Fair Division". En 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.
Texto completoGrüttemeier, Niels, Christian Komusiewicz y Nils Morawietz. "On the Parameterized Complexity of Polytree Learning". En 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.
Texto completoDeligkas, Argyrios, Eduard Eiben y Tiger-Lily Goldsmith. "Parameterized Complexity of Hotelling-Downs with Party Nominees". En 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.
Texto completoSilva, Janio Carlos Nascimento, Uéverton dos Santos Souza y Luiz Satoru Ochi. "Algorithmic Aspects of Problems Related to Optimization, Circuits, and Parameterized Complexity". En Concurso de Teses e Dissertações. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/ctd.2022.223305.
Texto completoBliznets, Ivan, Marek Cygan, Pawel Komosa, Lukáš Mach y Michał Pilipczuk. "Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems". En 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.
Texto completoArrighi, Emmanuel, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira y Petra Wolf. "Diversity in Kemeny Rank Aggregation: A Parameterized Approach". En 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.
Texto completo