default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNina Pardal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j6]François Dross, Claire Hilaire, Ivo Koch, Valeria Leoni, Nina Pardal
, Maria Inés Lopez Pujato, Vinícius Fernandes dos Santos:
On the proper interval completion problem within some chordal subclasses. Discret. Math. 348(1): 114274 (2025)- 2024
- [j5]Ivo Koch, Nina Pardal, Vinícius Fernandes dos Santos:
Edge deletion to tree-like graph classes. Discret. Appl. Math. 348: 122-131 (2024) - [c4]Santiago Cifuentes, Leopoldo Bertossi, Nina Pardal, Sergio Abriola, Maria Vanina Martinez, Miguel Romero:
The Distributional Uncertainty of the SHAP Score in Explainable Machine Learning. ECAI 2024: 971-978 - [c3]Sergio Abriola, Maria Vanina Martinez, Nina Pardal, Santiago Cifuentes, Edwin Pin Baque:
On the Complexity of Finding Set Repairs for Data-Graphs (Abstract Reprint). IJCAI 2024: 8472 - [i13]Santiago Cifuentes, Leopoldo Bertossi, Nina Pardal, Sergio Abriola, Maria Vanina Martinez, Miguel Romero:
The Distributional Uncertainty of the SHAP score in Explainable Machine Learning. CoRR abs/2401.12731 (2024) - [i12]Nina Pardal, Santiago Cifuentes, Edwin Pin, Maria Vanina Martinez, Sergio Abriola:
Computational Complexity of Preferred Subset Repairs on Data-Graphs. CoRR abs/2402.09265 (2024) - 2023
- [j4]Sergio Abriola, Santiago Cifuentes, Maria Vanina Martinez, Nina Pardal, Edwin Pin:
An epistemic approach to model uncertainty in data-graphs. Int. J. Approx. Reason. 160: 108948 (2023) - [j3]Sergio Abriola, María Vanina Martínez, Nina Pardal, Santiago Cifuentes, Edwin Pin Baque:
On the Complexity of Finding Set Repairs for Data-Graphs. J. Artif. Intell. Res. 76: 721-759 (2023) - [c2]Sergio Abriola, Santiago Cifuentes, Nina Pardal, Edwin Pin Baque:
Data-graph repairs: the preferred approach. AMW 2023 - [c1]Timon Barlag, Miika Hannula, Juha Kontinen, Nina Pardal, Jonni Virtema:
Unified Foundations of Team Semantics via Semirings. KR 2023: 75-85 - [i11]Timon Barlag, Miika Hannula, Juha Kontinen, Nina Pardal, Jonni Virtema:
Unified Foundations of Team Semantics via Semirings. CoRR abs/2303.07926 (2023) - [i10]Sergio Abriola, Santiago Cifuentes, Nina Pardal, Edwin Pin Baque:
Data-graph repairs: the preferred approach. CoRR abs/2304.00931 (2023) - [i9]Nina Pardal, Jonni Virtema:
A fine-grained framework for database repairs. CoRR abs/2306.15516 (2023) - 2022
- [j2]Flavia Bonomo-Braberman, Guillermo Durán, Nina Pardal, Martín D. Safe:
Forbidden induced subgraph characterization of circle graphs within split graphs. Discret. Appl. Math. 323: 43-75 (2022) - [j1]Guillermo Durán, Nina Pardal, Martín D. Safe:
2-Nested Matrices: Towards Understanding the Structure of Circle Graphs. Graphs Comb. 38(4): 111 (2022) - [i8]Sergio Abriola, Santiago Cifuentes, María Vanina Martínez, Nina Pardal, Edwin Pin Baque:
On the complexity of finding set repairs for data-graphs. CoRR abs/2206.07504 (2022) - [i7]Ivo Koch, Nina Pardal, Vinícius Fernandes dos Santos:
Edge deletion to tree-like graph classes. CoRR abs/2210.03839 (2022) - 2021
- [i6]Guillermo Durán, Nina Pardal, Martín D. Safe:
2-nested matrices: towards understanding the structure of circle graphs. CoRR abs/2103.03795 (2021) - [i5]Sergio Abriola, Santiago Cifuentes, María Vanina Martínez, Nina Pardal, Edwin Pin Baque:
An epistemic approach to model uncertainty in data-graphs. CoRR abs/2109.14112 (2021) - [i4]François Dross, Claire Hilaire, Ivo Koch, Valeria Leoni, Nina Pardal, Maria Inés Lopez Pujato, Vinícius Fernandes dos Santos:
On the proper interval completion problem within some chordal subclasses. CoRR abs/2110.07706 (2021) - 2020
- [b1]Nina Pardal:
Caractérisation structurelle de quelques problèmes dans les graphes de cordes et d'intervalles. (Structural characterization of some problems on circle and interval graphs). Paris 13 University, Villetaneuse, France, 2020 - [i3]Nina Pardal:
Structural characterization of some problems on circle and interval graphs. CoRR abs/2006.00099 (2020) - [i2]Flavia Bonomo-Braberman, Guillermo Alfredo Durán, Nina Pardal, Martín D. Safe:
Forbidden induced subgraph characterization of circle graphs within split graphs. CoRR abs/2007.00570 (2020)
2010 – 2019
- 2019
- [i1]Nina Pardal, Guillermo Alfredo Durán, Luciano N. Grippo, Martín D. Safe:
On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs. CoRR abs/1906.11970 (2019)
Coauthor Index
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 2024-11-07 20:34 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:
