default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgnasi Sau
Ignasi Sau Valls
Person information
- affiliation: CNRS, LIRMM, Montpellier, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c60]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. SODA 2025: 3728-3742- 2024
- [j81]Luís Cunha, Ignasi Sau, Uéverton S. Souza:
On the parameterized complexity of the median and closest problems under some permutation metrics. Algorithms Mol. Biol. 19(1): 24 (2024) - [j80]Stéphane Bessy
, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau:
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Discret. Appl. Math. 346: 80-94 (2024) - [j79]Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau:
Redicolouring digraphs: Directed treewidth and cycle-degeneracy. Discret. Appl. Math. 356: 191-208 (2024) - [j78]Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Faster parameterized algorithms for modification problems to minor-closed classes. TheoretiCS 3 (2024) - [c59]Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. ICALP 2024: 33:1-33:20 - [c58]Luís Cunha, Ignasi Sau, Uéverton S. Souza:
On the Complexity of the Median and Closest Permutation Problems. WABI 2024: 2:1-2:23 - [i68]Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations. CoRR abs/2404.16695 (2024) - [i67]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. CoRR abs/2406.18465 (2024) - [i66]Davi de Andrade, Júlio Araújo, Laure Morelle, Ignasi Sau, Ana Silva:
On the parameterized complexity of computing good edge-labelings. CoRR abs/2408.15181 (2024) - [i65]Raul Lopes, Ignasi Sau:
Constant congestion linkages in polynomially strong digraphs in polynomial time. CoRR abs/2409.03873 (2024) - [i64]Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Vertex identification to a forest. CoRR abs/2409.08883 (2024) - 2023
- [j77]Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau:
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets. Algorithmica 85(2): 444-491 (2023) - [j76]Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau:
Target set selection with maximum activation time. Discret. Appl. Math. 338: 199-217 (2023) - [j75]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale:
Reducing the vertex cover number via edge contractions. J. Comput. Syst. Sci. 136: 63-87 (2023) - [j74]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
k-apices of minor-closed graph classes. I. Bounding the obstructions. J. Comb. Theory B 161: 180-227 (2023) - [j73]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. SIAM J. Comput. 52(4): 865-912 (2023) - [c57]Victor A. Campos, Jonas Costa, Raul Lopes, Ignasi Sau:
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. ESA 2023: 30:1-30:18 - [c56]Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Compound Logics for Modification Problems. ICALP 2023: 61:1-61:21 - [c55]Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. ICALP 2023: 93:1-93:19 - [c54]Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming on Bipartite Tree Decompositions. IPEC 2023: 26:1-26:22 - [i63]Victor A. Campos, Jonas Costa, Raul Lopes, Ignasi Sau:
New Menger-like dualities in digraphs and applications to half-integral linkages. CoRR abs/2306.16134 (2023) - [i62]Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau:
Redicolouring digraphs: directed treewidth and cycle-degeneracy. CoRR abs/2307.06700 (2023) - [i61]Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic programming on bipartite tree decompositions. CoRR abs/2309.07754 (2023) - [i60]Luís Cunha, Ignasi Sau, Uéverton S. Souza:
On the Complexity of the Median and Closest Permutation Problems. CoRR abs/2311.17224 (2023) - 2022
- [j72]Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau:
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds. Algorithmica 84(11): 3365-3406 (2022) - [j71]Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau:
Adapting the Directed Grid Theorem into an FPT Algorithm. SIAM J. Discret. Math. 36(3): 1887-1917 (2022) - [j70]Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. SIAM J. Discret. Math. 36(4): 2737-2773 (2022) - [j69]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms. ACM Trans. Algorithms 18(3): 21:1-21:30 (2022) - [j68]Raul Lopes, Ignasi Sau:
A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps. Theor. Comput. Sci. 898: 75-91 (2022) - [c53]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale:
Reducing the Vertex Cover Number via Edge Contractions. MFCS 2022: 69:1-69:14 - [i59]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale:
Reducing the Vertex Cover Number via Edge Contractions. CoRR abs/2202.03322 (2022) - [i58]Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Faster parameterized algorithms for modification problems to minor-closed classes. CoRR abs/2210.02167 (2022) - 2021
- [j67]Guilherme de C. M. Gomes, Ignasi Sau:
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. Algorithmica 83(6): 1677-1706 (2021) - [j66]Rémy Belmonte, Ignasi Sau:
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. Algorithmica 83(8): 2351-2373 (2021) - [j65]Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva:
Coloring Problems on Bipartite Graphs of Small Diameter. Electron. J. Comb. 28(2): 2 (2021) - [j64]Ignasi Sau, Uéverton dos Santos Souza:
Hitting forbidden induced subgraphs on bounded treewidth graphs. Inf. Comput. 281: 104812 (2021) - [j63]Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva:
A unifying model for locally constrained spanning tree problems. J. Comb. Optim. 42(1): 125-150 (2021) - [j62]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza:
Reducing graph transversals via edge contractions. J. Comput. Syst. Sci. 120: 62-74 (2021) - [c52]Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau:
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover. IPEC 2021: 4:1-4:19 - [c51]Lucas Keiler, Carlos V. G. C. Lima, Ana Karolinna Maia, Rudini Menezes Sampaio, Ignasi Sau:
Target set selection with maximum activation time. LAGOS 2021: 86-96 - [i57]Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau:
Introducing lop-kernels: a framework for kernelization lower bounds. CoRR abs/2102.02484 (2021) - [i56]Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau:
Parameterized complexity of computing maximum minimal blocking and hitting sets. CoRR abs/2102.03404 (2021) - [i55]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
A more accurate view of the Flat Wall Theorem. CoRR abs/2102.06463 (2021) - [i54]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
k-apices of minor-closed graph classes. I. Bounding the obstructions. CoRR abs/2103.00882 (2021) - [i53]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. CoRR abs/2103.06536 (2021) - [i52]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. III. Lower bounds. CoRR abs/2103.06614 (2021) - [i51]Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau:
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. CoRR abs/2105.01582 (2021) - [i50]Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Compound Logics for Modification Problems. CoRR abs/2111.02755 (2021) - 2020
- [j61]Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva:
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. Algorithmica 82(6): 1616-1639 (2020) - [j60]Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva:
Dual Parameterization of Weighted Coloring. Algorithmica 82(8): 2316-2336 (2020) - [j59]Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira:
Maximum cuts in edge-colored graphs. Discret. Appl. Math. 281: 229-234 (2020) - [j58]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. III. Lower bounds. J. Comput. Syst. Sci. 109: 56-77 (2020) - [j57]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks 75(3): 259-277 (2020) - [j56]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. SIAM J. Discret. Math. 34(3): 1623-1648 (2020) - [j55]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Theor. Comput. Sci. 814: 135-152 (2020) - [c50]Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. ICALP 2020: 16:1-16:19 - [c49]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. ICALP 2020: 95:1-95:20 - [c48]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza:
Reducing Graph Transversals via Edge Contractions. MFCS 2020: 64:1-64:15 - [c47]Raul Lopes, Ignasi Sau:
A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. MFCS 2020: 68:1-68:15 - [c46]Ignasi Sau, Uéverton dos Santos Souza:
Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. MFCS 2020: 82:1-82:15 - [c45]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. SODA 2020: 951-970 - [c44]Rémy Belmonte, Ignasi Sau:
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. WG 2020: 67-79 - [i49]Rémy Belmonte, Ignasi Sau:
On the complexity of finding large odd induced subgraphs and odd colorings. CoRR abs/2002.06078 (2020) - [i48]Ignasi Sau, Uéverton S. Souza:
Hitting forbidden induced subgraphs on bounded treewidth graphs. CoRR abs/2004.08324 (2020) - [i47]Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva:
Coloring Problems on Bipartite Graphs of Small Diameter. CoRR abs/2004.11173 (2020) - [i46]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
k-apices of minor-closed graph classes. II. Parameterized algorithms. CoRR abs/2004.12692 (2020) - [i45]Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. CoRR abs/2004.12865 (2020) - [i44]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza:
Reducing graph transversals via edge contractions. CoRR abs/2005.01460 (2020) - [i43]Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva:
A Unifying Model for Locally Constrained Spanning Tree Problems. CoRR abs/2005.10328 (2020) - [i42]Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau:
Target set selection with maximum activation time. CoRR abs/2007.05246 (2020) - [i41]Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau:
Adapting the Directed Grid Theorem into an FPT Algorithm. CoRR abs/2007.07738 (2020)
2010 – 2019
- 2019
- [j54]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels for Packing Problems. Algorithmica 81(4): 1615-1656 (2019) - [j53]Marin Bougeret, Ignasi Sau:
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? Algorithmica 81(10): 4043-4068 (2019) - [j52]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Approximating maximum uniquely restricted matchings in bipartite graphs. Discret. Appl. Math. 267: 30-40 (2019) - [j51]Josefran de Oliveira Bastos, Fabrício Siqueira Benevides, Guilherme Oliveira Mota, Ignasi Sau:
Counting Gallai 3-colorings of complete graphs. Discret. Math. 342(9): 2618-2631 (2019) - [j50]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Upper bounds on the uniquely restricted chromatic index. J. Graph Theory 91(3): 251-258 (2019) - [j49]Júlio Araújo, Cláudia Linhares Sales, Ignasi Sau, Ana Silva:
Weighted proper orientations of trees and graphs of bounded treewidth. Theor. Comput. Sci. 771: 39-48 (2019) - [c43]Guilherme de C. M. Gomes, Ignasi Sau:
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. IPEC 2019: 19:1-19:15 - [c42]Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau:
Adapting The Directed Grid Theorem into an FPT Algorithm. LAGOS 2019: 229-240 - [e1]Ignasi Sau, Dimitrios M. Thilikos:
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers. Lecture Notes in Computer Science 11789, Springer 2019, ISBN 978-3-030-30785-1 [contents] - [i40]Guilherme de C. M. Gomes, Ignasi Sau:
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. CoRR abs/1905.03134 (2019) - [i39]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. CoRR abs/1907.04442 (2019) - [i38]Raul Lopes, Ignasi Sau:
A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps. CoRR abs/1909.13848 (2019) - 2018
- [b1]Ignasi Sau:
Some Contributions to Parameterized Complexity. (Quelques Contributions en Complexité Paramétrée). University of Montpellier, France, 2018 - [j48]Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica 80(1): 116-135 (2018) - [j47]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An O(log OPT)-Approximation for Covering and Packing Minor Models of θr. Algorithmica 80(4): 1330-1356 (2018) - [j46]Henri Perret du Cray, Ignasi Sau:
Improved FPT algorithms for weighted independent set in bull-free graphs. Discret. Math. 341(2): 451-462 (2018) - [j45]Valentin Garnero, Ignasi Sau:
A Linear Kernel for Planar Total Dominating Set. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j44]Julien Baste, Marc Noy, Ignasi Sau:
On the number of labeled graphs of bounded treewidth. Eur. J. Comb. 71: 12-21 (2018) - [j43]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms 52-53: 133-142 (2018) - [j42]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A Tight Erdös-Pósa Function for Wheel Minors. SIAM J. Discret. Math. 32(3): 2302-2312 (2018) - [j41]Júlio Araújo, Julien Baste, Ignasi Sau:
Ruling out FPT algorithms for Weighted Coloring on forests. Theor. Comput. Sci. 729: 11-19 (2018) - [j40]Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza:
On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph. Theor. Comput. Sci. 746: 36-48 (2018) - [c41]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. IPEC 2018: 2:1-2:13 - [c40]Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva:
Dual Parameterization of Weighted Coloring. IPEC 2018: 12:1-12:14 - [c39]Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva:
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. LATIN 2018: 66-79 - [i37]Júlio Araújo, Cláudia Linhares Sales, Ignasi Sau, Ana Silva:
Weighted proper orientations of trees and graphs of bounded treewidth. CoRR abs/1804.03884 (2018) - [i36]Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira:
Maximum cuts in edge-colored graphs. CoRR abs/1805.00858 (2018) - [i35]Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva:
Dual parameterization of Weighted Coloring. CoRR abs/1805.06699 (2018) - 2017
- [j39]Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos:
A linear kernel for planar red-blue dominating set. Discret. Appl. Math. 217: 536-547 (2017) - [j38]Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira:
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j37]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
Minors in graphs of large ϴr-girth. Eur. J. Comb. 65: 106-121 (2017) - [j36]Rubens Sucupira, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza:
Maximum Cuts in Edge-colored Graphs. Electron. Notes Discret. Math. 62: 87-92 (2017) - [j35]Júlio Araújo, Julien Baste, Ignasi Sau:
Ruling out FPT algorithms for Weighted Coloring on forests. Electron. Notes Discret. Math. 62: 195-200 (2017) - [j34]Julien Baste, Fairouz Beggas, Hamamache Kheddouci, Ignasi Sau:
On the parameterized complexity of the Edge Monitoring problem. Inf. Process. Lett. 121: 39-44 (2017) - [j33]Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized algorithms for min-max multiway cut and list digraph homomorphism. J. Comput. Syst. Sci. 86: 191-206 (2017) - [j32]Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. 89: 315-327 (2017) - [j31]Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau:
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Theory Comput. Syst. 61(3): 777-794 (2017) - [j30]Luis Pedro Montejano, Ignasi Sau:
On the complexity of computing the k-restricted edge-connectivity of a graph. Theor. Comput. Sci. 662: 31-39 (2017) - [j29]Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theor. Comput. Sci. 690: 91-103 (2017) - [c38]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum ℱ -Overlay Problem. IWOCA 2017: 116-127 - [c37]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC 2017: 3:1-3:12 - [c36]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. IPEC 2017: 4:1-4:12 - [c35]Marin Bougeret, Ignasi Sau:
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?. IPEC 2017: 10:1-10:13 - [c34]Julien Baste, Marc Noy, Ignasi Sau:
On the Number of Labeled Graphs of Bounded Treewidth. WG 2017: 88-99 - [c33]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Uniquely Restricted Matchings and Edge Colorings. WG 2017: 100-112 - [i34]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR abs/1703.01686 (2017) - [i33]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum F-Overlay Problem. CoRR abs/1703.05156 (2017) - [i32]Júlio Araújo, Julien Baste, Ignasi Sau:
Ruling out FPT algorithms for Weighted Coloring on forests. CoRR abs/1703.09726 (2017) - [i31]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. I. General upper bounds. CoRR abs/1704.07284 (2017) - [i30]Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza:
On the (parameterized) complexity of recognizing well-covered (r, l)-graphs. CoRR abs/1705.09177 (2017) - [i29]Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva:
On the complexity of finding internally vertex-disjoint long directed paths. CoRR abs/1706.09066 (2017) - [i28]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A tight Erdős-Pósa function for wheel minors. CoRR abs/1710.06282 (2017) - 2016
- [j28]Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An edge variant of the Erdős-Pósa property. Discret. Math. 339(8): 2027-2035 (2016) - [j27]Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar:
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. ACM Trans. Algorithms 12(2): 21:1-21:41 (2016) - [c32]Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca:
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. AAIM 2016: 53-64 - [c31]Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza:
On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. COCOA 2016: 423-437 - [c30]Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. WG 2016: 195-206 - [i27]Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca:
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. CoRR abs/1604.03008 (2016) - [i26]Julien Baste, Marc Noy, Ignasi Sau:
The number of labeled graphs of bounded treewidth. CoRR abs/1604.07273 (2016) - [i25]Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. CoRR abs/1605.00532 (2016) - [i24]Marin Bougeret, Ignasi Sau:
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? CoRR abs/1609.08095 (2016) - [i23]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit linear kernels for packing problems. CoRR abs/1610.06131 (2016) - [i22]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Uniquely restricted matchings and edge colorings. CoRR abs/1611.06815 (2016) - 2015
- [j26]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels via Dynamic Programming. SIAM J. Discret. Math. 29(4): 1864-1894 (2015) - [j25]Julien Baste, Ignasi Sau:
The role of planarity in connectivity problems parameterized by treewidth. Theor. Comput. Sci. 570: 1-14 (2015) - [c29]Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR 2015: 123-142 - [c28]Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC 2015: 78-89 - [c27]Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-cut Decomposition. WAOA 2015: 35-46 - [c26]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r. WAOA 2015: 122-132 - [c25]Luis Pedro Montejano, Ignasi Sau:
On the Complexity of Computing the k-restricted Edge-connectivity of a Graph. WG 2015: 219-233 - [i21]Luis Pedro Montejano, Ignasi Sau:
On the complexity of computing the k-restricted edge-connectivity of a graph. CoRR abs/1502.07659 (2015) - [i20]Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau:
Parameterized complexity dichotomy for (r, ℓ)-Vertex Deletion. CoRR abs/1504.05515 (2015) - [i19]Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-Cut Decomposition. CoRR abs/1509.04880 (2015) - [i18]Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. CoRR abs/1509.07404 (2015) - [i17]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
Minors in graphs of large $θr-girth. CoRR abs/1510.03041 (2015) - [i16]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An O(log OPT)-approximation for covering and packing minor models of $θr. CoRR abs/1510.03945 (2015) - [i15]Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira:
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. CoRR abs/1512.05223 (2015) - 2014
- [j24]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. Theory Comput. Syst. 54(1): 45-72 (2014) - [j23]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé:
Hitting and Harvesting Pumpkins. SIAM J. Discret. Math. 28(3): 1363-1390 (2014) - [j22]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic programming for graphs on surfaces. ACM Trans. Algorithms 10(2): 8:1-8:26 (2014) - [c24]Julien Baste, Ignasi Sau:
The Role of Planarity in Connectivity Problems Parameterized by Treewidth. IPEC 2014: 63-74 - [c23]Henri Perret du Cray, Ignasi Sau:
Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs. IPEC 2014: 282-293 - [c22]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels via Dynamic Programming. STACS 2014: 312-324 - [i14]Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR abs/1403.5702 (2014) - [i13]Henri Perret du Cray, Ignasi Sau:
Improved FPT algorithms for weighted independent set in bull-free graphs. CoRR abs/1407.1706 (2014) - [i12]Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos:
A linear kernel for planar red-blue dominating set. CoRR abs/1408.6388 (2014) - 2013
- [j21]David Peleg, Ignasi Sau, Mordechai Shalom:
On approximating the d-girth of a graph. Discret. Appl. Math. 161(16-17): 2587-2596 (2013) - [j20]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Asymptotic enumeration of non-crossing partitions on surfaces. Discret. Math. 313(5): 635-649 (2013) - [c21]Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar:
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. ICALP (1) 2013: 613-624 - [i11]Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos:
A linear kernel for planar red-blue dominating set. CTW 2013: 117-120 - [i10]Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An edge variant of the Erdős-Pósa property. CoRR abs/1311.1108 (2013) - [i9]Julien Baste, Ignasi Sau:
The role of planarity in connectivity problems parameterized by treewidth. CoRR abs/1312.2889 (2013) - [i8]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit linear kernels via dynamic programming. CoRR abs/1312.6585 (2013) - 2012
- [j19]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs. Algorithmica 64(1): 69-84 (2012) - [j18]Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh:
On the approximability of some degree-constrained subgraph problems. Discret. Appl. Math. 160(12): 1661-1679 (2012) - [j17]Ignasi Sau, Petra Sparl, Janez Zerovnik:
Simpler multicoloring of triangle-free hexagonal graphs. Discret. Math. 312(1): 181-187 (2012) - [j16]Omid Amini, Ignasi Sau, Saket Saurabh:
Parameterized complexity of finding small degree-constrained subgraphs. J. Discrete Algorithms 10: 70-83 (2012) - [j15]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado:
GMPLS label space minimization through hypergraph layouts. Theor. Comput. Sci. 444: 3-16 (2012) - [j14]George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Placing regenerators in optical networks to satisfy multiple sets of requests. IEEE/ACM Trans. Netw. 20(6): 1870-1879 (2012) - [c20]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming for H-minor-free Graphs. COCOON 2012: 86-97 - [c19]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. WG 2012: 308-319 - [i7]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. CoRR abs/1205.3728 (2012) - [i6]Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar:
Linear kernels and single-exponential algorithms via protrusion decompositions. CoRR abs/1207.0835 (2012) - [i5]Valentin Garnero, Ignasi Sau:
A linear kernel for planar total dominating set. CoRR abs/1211.0978 (2012) - 2011
- [j13]Ignasi Sau, Dimitrios M. Thilikos:
On self-duality of branchwidth in graphs of bounded genus. Discret. Appl. Math. 159(17): 2184-2186 (2011) - [j12]Jean-Claude Bermond, Xavier Muñoz, Ignasi Sau:
Traffic grooming in bidirectional WDM ring networks. Networks 58(1): 20-35 (2011) - [j11]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
The Recognition of Tolerance and Bounded Tolerance Graphs. SIAM J. Comput. 40(5): 1234-1257 (2011) - [j10]Xavier Muñoz, Zhentao Li, Ignasi Sau:
Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs. SIAM J. Discret. Math. 25(4): 1490-1505 (2011) - [j9]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412(50): 7018-7028 (2011) - [c18]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé:
Hitting and Harvesting Pumpkins. ESA 2011: 394-407 - [c17]David Peleg, Ignasi Sau, Mordechai Shalom:
On Approximating the d-Girth of a Graph. SOFSEM 2011: 467-481 - [i4]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Asymptotic Enumeration of Non-crossing Partitions on Surfaces. CoRR abs/1104.2477 (2011) - [i3]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming for Graphs on Surfaces. CoRR abs/1104.2486 (2011) - [i2]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé:
Hitting and Harvesting Pumpkins. CoRR abs/1105.2704 (2011) - 2010
- [j8]Ignasi Sau, Dimitrios M. Thilikos:
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. J. Discrete Algorithms 8(3): 330-338 (2010) - [j7]David Coudert, Frédéric Giroire, Ignasi Sau:
Circuits in Graphs through a prescribed Set of Ordered vertices. J. Interconnect. Networks 11(3-4): 121-141 (2010) - [j6]Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau:
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM J. Discret. Math. 24(2): 400-419 (2010) - [c16]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs. ESA (1) 2010: 97-109 - [c15]George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. ICALP (2) 2010: 333-344 - [c14]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming for Graphs on Surfaces. ICALP (1) 2010: 372-383 - [c13]Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Traffic Grooming in Star Networks via Matching Techniques. SIROCCO 2010: 41-56 - [c12]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
The Recognition of Tolerance and Bounded Tolerance Graphs. STACS 2010: 585-596 - [c11]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Faster Parameterized Algorithms for Minor Containment. SWAT 2010: 322-333 - [p2]Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Traffic Grooming: Combinatorial Results and Practical Resolutions. Graphs and Algorithms in Communication Networks 2010: 63-94 - [p1]Ignasi Sau, Janez Zerovnik:
Permutation Routing and (ℓ, k)-Routing on Plane Grids. Graphs and Algorithms in Communication Networks 2010: 265-279 - [i1]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
The Recognition of Tolerance and Bounded Tolerance Graphs. CoRR abs/1001.3251 (2010)
2000 – 2009
- 2009
- [j5]Ignasi Sau, Dimitrios M. Thilikos:
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs. Electron. Notes Discret. Math. 32: 59-66 (2009) - [j4]Florian Huc, Ignasi Sau, Janez Zerovnik:
(l, k)-ROUTING ON PLANE GRIDS. J. Interconnect. Networks 10(1-2): 27-57 (2009) - [j3]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
A New Intersection Model and Improved Algorithms for Tolerance Graphs. SIAM J. Discret. Math. 23(4): 1800-1813 (2009) - [j2]Omid Amini, Stéphane Pérennes, Ignasi Sau:
Hardness and approximation of traffic grooming. Theor. Comput. Sci. 410(38-40): 3751-3760 (2009) - [c10]Ignasi Sau, Dimitrios M. Thilikos:
On Self-Duality of Branchwidth in Graphs of Bounded Genus. CTW 2009: 19-22 - [c9]David Coudert, Frédéric Giroire, Ignasi Sau:
Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. IWOCA 2009: 134-145 - [c8]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, Ignasi Sau, Fernando Solano Donado:
MPLS Label Stacking on the Line Network. Networking 2009: 809-820 - [c7]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado:
Designing Hypergraph Layouts to GMPLS Routing Strategies. SIROCCO 2009: 57-71 - [c6]Zhentao Li, Ignasi Sau:
Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. WG 2009: 250-261 - [c5]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
A New Intersection Model and Improved Algorithms for Tolerance Graphs. WG 2009: 285-295 - 2008
- [j1]Janez Zerovnik, Ignasi Sau:
An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [c4]Omid Amini, Ignasi Sau, Saket Saurabh:
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. IWPEC 2008: 13-29 - [c3]Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh:
Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA 2008: 29-42 - [c2]Xavier Muñoz, Ignasi Sau:
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. WG 2008: 300-311 - 2007
- [c1]Omid Amini, Stéphane Pérennes, Ignasi Sau:
Hardness and Approximation of Traffic Grooming. ISAAC 2007: 561-573
Coauthor Index
Uéverton S. Souza
aka: Uéverton dos Santos Souza
aka: Uéverton dos Santos Souza
[c60] [j78] [i67] [i64] [j74] [j73] [c56] [c55] [c54] [i61] [j69] [i58] [i55] [i54] [i53] [i52] [i50] [j58] [j57] [j56] [j55] [c49] [c45] [i46] [j54] [e1] [i39] [j48] [j47] [c41] [j39] [j37] [j33] [j32] [c37] [c36] [i34] [i31] [j28] [i23] [j26] [c29] [c28] [c27] [c26] [i19] [i18] [i17] [i16] [j22] [c22] [i14] [i12] [j20] [i11] [i10] [i8] [j19] [c20] [j13] [j9] [i4] [i3] [j8] [c16] [c14] [c11] [j5] [c10]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-29 21:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
