default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid García-Soriano
Person information
- affiliation: Polytechnic University of Catalonia (UPC), Barcelona, Spain
- affiliation (PhD 2012): University of Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j8]Antonio Ferrara, David García-Soriano, Francesco Bonchi:
Beyond Shortest Paths: Node Fairness in Route Recommendation. Proc. VLDB Endow. 18(9): 3230-3242 (2025)- 2022
- [b1]Francesco Bonchi, David García-Soriano
, Francesco Gullo:
Correlation Clustering. Synthesis Lectures on Data Mining and Knowledge Discovery, Springer 2022, ISBN 978-3-031-79198-7, pp. 1-133 - [c18]Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Dense and well-connected subgraph detection in dual networks. SDM 2022: 361-369 - 2021
- [j7]Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Finding densest k-connected subgraphs. Discret. Appl. Math. 305: 34-47 (2021) - [c17]David García-Soriano, Francesco Bonchi:
Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints. KDD 2021: 436-446 - [i16]David García-Soriano, Francesco Bonchi:
Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints. CoRR abs/2106.08652 (2021) - [i15]Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Dense and well-connected subgraph detection in dual networks. CoRR abs/2112.03337 (2021) - 2020
- [j6]David García-Soriano, Francesco Bonchi:
Fair-by-design matching. Data Min. Knowl. Discov. 34(5): 1291-1335 (2020) - [c16]David García-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis:
Query-Efficient Correlation Clustering. WWW 2020: 1468-1478 - [i14]David García-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis:
Query-Efficient Correlation Clustering. CoRR abs/2002.11557 (2020) - [i13]Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Finding Densest k-Connected Subgraphs. CoRR abs/2007.01533 (2020)
2010 – 2019
- 2018
- [i12]David García-Soriano, Francesco Bonchi:
Fair-by-design algorithms: matching problems and beyond. CoRR abs/1802.02562 (2018) - 2017
- [j5]Matteo Riondato, David García-Soriano, Francesco Bonchi:
Graph summarization with quality guarantees. Data Min. Knowl. Discov. 31(2): 314-349 (2017) - [c15]Natali Ruchansky, Francesco Bonchi, David García-Soriano, Francesco Gullo, Nicolas Kourtellis:
To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem. CIKM 2017: 879-888 - [c14]Gilad Asharov, Francesco Bonchi, David García-Soriano, Tamir Tassa:
Secure Centrality Computation Over Multiple Networks. WWW 2017: 957-966 - [i11]Natali Ruchansky, Francesco Bonchi, David García-Soriano, Francesco Gullo, Nicolas Kourtellis:
To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem. CoRR abs/1709.01123 (2017) - 2016
- [c13]Dimitris Liparas, Stefanos Vrochidis, Ioannis Kompatsiaris, Gerard Casamayor, Leo Wanner, Ioannis Arapakis, David García-Soriano, Reinhard Busch, Boris Vaisman, Boyan Simeonov, Vladimir Alexiev, Andrey Belous, Emmanuel Jamin, Nicolaus Heise, Tilman Wagner, Michael Jugov, Mirja Eckhoff, Teresa Forrellat, Martí Puigbó:
The MULTISENSOR Project - Development of Multimedia Content Integration Technologies for Journalism, Media Monitoring and International Exporting Decision Support. MMDA@ECAI 2016: 1-7 - [c12]Ya Le, Eric Bax, Nicola Barbieri, David García-Soriano, Jitesh Mehta, James Li:
Validation of matching. IJCNN 2016: 4457-4464 - [c11]Yasir Mehmood, Francesco Bonchi, David García-Soriano:
Spheres of Influence for More Effective Viral Marketing. SIGMOD Conference 2016: 711-726 - 2015
- [c10]Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, David García-Soriano, Nicolas Kourtellis, Marco Serafini:
The power of both choices: Practical load balancing for distributed stream processing engines. ICDE 2015: 137-148 - [c9]Natali Ruchansky, Francesco Bonchi, David García-Soriano, Francesco Gullo, Nicolas Kourtellis:
The Minimum Wiener Connector Problem. SIGMOD Conference 2015: 1587-1602 - [i10]Natali Ruchansky, Francesco Bonchi, David García-Soriano, Francesco Gullo, Nicolas Kourtellis:
The Minimum Wiener Connector. CoRR abs/1504.00513 (2015) - [i9]Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, David García-Soriano, Nicolas Kourtellis, Marco Serafini:
The Power of Both Choices: Practical Load Balancing for Distributed Stream Processing Engines. CoRR abs/1504.00788 (2015) - [i8]Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, David García-Soriano, Nicolas Kourtellis, Marco Serafini:
Partial Key Grouping: Load-Balanced Partitioning of Distributed Streams. CoRR abs/1510.07623 (2015) - 2014
- [c8]Matteo Riondato, David García-Soriano, Francesco Bonchi:
Graph Summarization with Quality Guarantees. ICDM 2014: 947-952 - [c7]Francesco Bonchi, David García-Soriano, Edo Liberty:
Correlation clustering: from theory to practice. KDD 2014: 1972 - [c6]David García-Soriano, Konstantin Kutzkov:
Triangle counting in streamed graphs via small vertex covers. SDM 2014: 352-360 - [i7]Ya Le, Eric Bax, Nicola Barbieri, David García-Soriano, Jitesh Mehta, James Li:
Validation of Network Reconciliation. CoRR abs/1411.0023 (2014) - 2013
- [j4]Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf:
The non-adaptive query complexity of testing k-parities. Chic. J. Theor. Comput. Sci. 2013 (2013) - [j3]Noga Alon, Eric Blais, Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Nearly Tight Bounds for Testing Function Isomorphism. SIAM J. Comput. 42(2): 459-493 (2013) - [i6]Francesco Bonchi, David García-Soriano, Konstantin Kutzkov:
Local correlation clustering. CoRR abs/1312.5105 (2013) - 2012
- [j2]Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Monotonicity testing and shortest-path routing on the cube. Comb. 32(1): 35-53 (2012) - [c5]Sourav Chakraborty, Eldar Fischer, David García-Soriano, Arie Matsliah:
Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. CCC 2012: 148-158 - [i5]Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf:
The non-adaptive query complexity of testing k-parities. CoRR abs/1209.3849 (2012) - 2011
- [c4]Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Efficient Sample Extractors for Juntas with Applications. ICALP (1) 2011: 545-556 - [c3]Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Cycle Detection, Order Finding and Discrete Log with Jumps. ICS 2011: 284-297 - [c2]Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Nearly Tight Bounds for Testing Function Isomorphism. SODA 2011: 1683-1702 - 2010
- [j1]Harry Buhrman, David García-Soriano, Arie Matsliah:
Learning parities in the mistake-bound model. Inf. Process. Lett. 111(1): 16-21 (2010) - [c1]Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Monotonicity Testing and Shortest-Path Routing on the Cube. APPROX-RANDOM 2010: 462-475 - [i4]Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Nearly Tight Bounds for Testing Function Isomorphism. Electron. Colloquium Comput. Complex. TR10 (2010) - [i3]David García-Soriano, Arie Matsliah, Sourav Chakraborty, Jop Briët:
Monotonicity Testing and Shortest-Path Routing on the Cube. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [i2]Harry Buhrman, David García-Soriano, Arie Matsliah:
Learning Parities in the Mistake-Bound model. Algebraic Methods in Computational Complexity 2009 - [i1]Harry Buhrman, David García-Soriano, Arie Matsliah:
Learning parities in the mistake-bound model. Electron. Colloquium Comput. Complex. TR09 (2009)
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 2025-11-22 04:58 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:
