Literatura científica selecionada sobre o tema "Parameterized complexity algorithms"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Parameterized complexity algorithms".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Parameterized complexity algorithms"
Marx, D. "Parameterized Complexity and Approximation Algorithms". Computer Journal 51, n.º 1 (6 de março de 2007): 60–78. http://dx.doi.org/10.1093/comjnl/bxm048.
Texto completo da fonteDabrowski, 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 de junho de 2022): 3724–32. http://dx.doi.org/10.1609/aaai.v36i4.20286.
Texto completo da fonteLiu, Yunlong, Jianxin Wang, Jiong Guo e Jianer Chen. "Complexity and parameterized algorithms for Cograph Editing". Theoretical Computer Science 461 (novembro de 2012): 45–54. http://dx.doi.org/10.1016/j.tcs.2011.11.040.
Texto completo da fonteGasarch, 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 de março de 2007): 137–40. http://dx.doi.org/10.1093/comjnl/bxm047.
Texto completo da fonteBulteau, Laurent, e Mathias Weller. "Parameterized Algorithms in Bioinformatics: An Overview". Algorithms 12, n.º 12 (1 de dezembro de 2019): 256. http://dx.doi.org/10.3390/a12120256.
Texto completo da fonteKellerhals, 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 de junho de 2023): 4400–4408. http://dx.doi.org/10.1609/aaai.v37i4.25560.
Texto completo da fonteBlaž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 de junho de 2023): 6262–70. http://dx.doi.org/10.1609/aaai.v37i5.25771.
Texto completo da fonteFichte, Johannes K., Markus Hecher e Arne Meier. "Counting Complexity for Reasoning in Abstract Argumentation". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julho de 2019): 2827–34. http://dx.doi.org/10.1609/aaai.v33i01.33012827.
Texto completo da fonteEiben, 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 de junho de 2023): 6313–21. http://dx.doi.org/10.1609/aaai.v37i5.25777.
Texto completo da fonteFeldmann, 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 de junho de 2020): 146. http://dx.doi.org/10.3390/a13060146.
Texto completo da fonteTeses / dissertações sobre o assunto "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 completo da fonteKim, 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 completo da fonteEnciso, 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 completo da fontePh.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 completo da fonteZhang, 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 completo da fonteChan, Hubert. "A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs". Thesis, University of Waterloo, 2003. http://hdl.handle.net/10012/1090.
Texto completo da fonteCadena, Jose Eduardo. "Finding Interesting Subgraphs with Guarantees". Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/81960.
Texto completo da fontePh. 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 completo da fonteDaligault, 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 completo da fonteChopin, 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 completo da fonteLivros sobre o assunto "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.
Encontre o texto completo da fonteIWPEC 2008 (2008 Victoria, B.C.). Parameterized and exact computation: Third international workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008 : proceedings. Berlin: Springer, 2008.
Encontre o texto completo da fonteRaman, V. Parameterized and Exact Computation: 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.
Encontre o texto completo da fonteThilikos, Dimitrios M. Parameterized and Exact Computation: 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Encontre o texto completo da fonteIWPEC 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.
Encontre o texto completo da fonteMarx, 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.
Encontre o texto completo da fonteParameterized Complexity Theory. Springer, 2010.
Encontre o texto completo da fonteFlum, J., e M. Grohe. Parameterized Complexity Theory. Springer, 2006.
Encontre o texto completo da fonteRosamond, Frances, Neeldhara Misra e Meirav Zehavi, eds. New Frontiers in Parameterized Complexity and Algorithms. MDPI, 2024. http://dx.doi.org/10.3390/books978-3-7258-1302-5.
Texto completo da fonteParameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer, 2006.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "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.
Texto completo da fonteBazgan, 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.
Texto completo da fonteCooper, 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.
Texto completo da fonteAravind, 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.
Texto completo da fontePanolan, 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.
Texto completo da fonteDö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.
Texto completo da fontePanolan, 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.
Texto completo da fonteDey, 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.
Texto completo da fonteLiu, 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.
Texto completo da fonteAgrawal, 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.
Texto completo da fonteTrabalhos de conferências sobre o assunto "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.
Texto completo da fonteNeumann, 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.
Texto completo da fonteLin, 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.
Texto completo da fonteMaiti, 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.
Texto completo da fonteDeligkas, 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.
Texto completo da fonteGrü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.
Texto completo da fonteDeligkas, 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.
Texto completo da fonteSilva, 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.
Texto completo da fonteBliznets, 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.
Texto completo da fonteArrighi, 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.
Texto completo da fonte