Artykuły udostępnione publicznie: - Ueverton S. SouzaWięcej informacji
Niedostępne w żadnym miejscu: 2
Succinct certification of monotone circuits
MR Alves, M de Oliveira Oliveira, JCN Silva, U dos Santos Souza
Theoretical Computer Science 889, 1-13, 2021
Upoważnienia: Research Council of Norway
Succinct monotone circuit certification: planarity and parameterized complexity
MR Alves, M de Oliveira Oliveira, JCN Silva, U dos Santos Souza
International Computing and Combinatorics Conference, 496-507, 2020
Upoważnienia: Research Council of Norway
Dostępne w jakimś miejscu: 16
Hitting forbidden induced subgraphs on bounded treewidth graphs
I Sau, U dos Santos Souza
Information and Computation 281, 104812, 2021
Upoważnienia: Agence Nationale de la Recherche
On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph
SR Alves, KK Dabrowski, L Faria, S Klein, I Sau, US Souza
Theoretical Computer Science 746, 36-48, 2018
Upoważnienia: UK Engineering and Physical Sciences Research Council
A tight quasi-polynomial bound for global label min-cut
L Jaffke, PT Lima, T Masařík, M Pilipczuk, US Souza
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
Upoważnienia: European Commission, Research Council of Norway
Taming graphs with no large creatures and skinny ladders
J Gajarský, L Jaffke, PT de Lima, J Masaříková, M Pilipczuk, P Rzążewski, ...
SIAM Journal on Discrete Mathematics 38 (4), 3140-3149, 2024
Upoważnienia: European Commission, Narodowe Centrum Nauki
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
K CS, D Marx, M Pilipczuk, U Souza
2024 Symposium on Simplicity in Algorithms (SOSA), 383-395, 2024
Upoważnienia: US National Science Foundation, Villum Foundation, European Commission
Linear‐time algorithms for eliminating claws in graphs
F Bonomo‐Braberman, JR Nascimento, FS Oliveira, US Souza, ...
International Transactions in Operational Research 31 (1), 296-315, 2024
Upoważnienia: Government of Argentina
Co-degeneracy and co-treewidth: using the complement to solve dense instances
G Duarte, MDO Oliveira, US Souza
Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2021
Upoważnienia: Research Council of Norway
Maximum cuts in edge-colored graphs
L Faria, S Klein, I Sau, US Souza, R Sucupira
Discrete Applied Mathematics 281, 229-234, 2020
Upoważnienia: Agence Nationale de la Recherche
Computing the best-case energy complexity of satisfying assignments in monotone circuits
JCN Silva, US Souza
Theoretical Computer Science 932, 41-55, 2022
Upoważnienia: European Commission
Simple and tight complexity lower bounds for solving Rabin games
A Casares, M Pilipczuk, M Pilipczuk, US Souza, KS Thejaswini
2024 Symposium on Simplicity in Algorithms (SOSA), 160-167, 2024
Upoważnienia: European Commission, Narodowe Centrum Nauki
Recognizing well-dominated graphs is coNP-complete
A Agrawal, H Fernau, P Kindermann, K Mann, US Souza
Information Processing Letters 183, 106419, 2024
Upoważnienia: European Commission
Reducing the vertex cover number via edge contractions
PT Lima, VF dos Santos, I Sau, US Souza, P Tale
Journal of Computer and System Sciences 136, 63-87, 2023
Upoważnienia: Helmholtz Association, European Commission, Agence Nationale de la Recherche
On the minimum cycle cover problem on graphs with bounded co-degeneracy
GL Duarte, US Souza
International Workshop on Graph-Theoretic Concepts in Computer Science, 187-200, 2022
Upoważnienia: European Commission
Computing the zig-zag number of directed graphs
MC Dourado, CMH de Figueiredo, AA de Melo, M de Oliveira Oliveira, ...
Discrete Applied Mathematics 312, 86-105, 2022
Upoważnienia: Research Council of Norway
On the parameterized complexity of the median and closest problems under some permutation metrics
L Cunha, I Sau, U Souza
Algorithms for Molecular Biology 19 (1), 24, 2024
Upoważnienia: Agence Nationale de la Recherche
Perfect matching cuts partitioning a graph into complementary subgraphs
D Castonguay, EMM Coelho, H Coelho, JR Nascimento, US Souza
International Workshop on Combinatorial Algorithms, 257-269, 2022
Upoważnienia: European Commission
Informacje na temat publikacji i finansowania automatycznie określa program komputerowy