default search action
Dóra Erdös
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c9]Charalampos Mavroforakis, Dóra Erdös, Mark Crovella, Evimaria Terzi:
Active Positive-Definite Matrix Completion. SDM 2017: 264-272 - [i5]Sanaz Bahargam, Dóra Erdös, Azer Bestavros, Evimaria Terzi:
Team Formation for Scheduling Educational Material in Massive Online Classes. CoRR abs/1703.08762 (2017) - 2015
- [b1]Dóra Erdös:
Centrality measures and analyzing dot-product graphs. Boston University, USA, 2015 - [c8]Sanaz Bahargam, Dóra Erdös, Azer Bestavros, Evimaria Terzi:
Personalized Education; Solving a Group Formation and Scheduling Problem for Educational Content. EDM 2015: 488-491 - [c7]Dóra Erdös, Vatche Ishakian, Azer Bestavros
, Evimaria Terzi:
A Divide-and-Conquer Algorithm for Betweenness Centrality. SDM 2015: 433-441 - 2014
- [j3]Dóra Erdös, András Frank, Krisztián Kun:
Sink-Stable Sets of Digraphs. SIAM J. Discret. Math. 28(4): 1651-1674 (2014) - [j2]Dóra Erdös, Rainer Gemulla
Reconstructing Graphs from Neighborhood Data. ACM Trans. Knowl. Discov. Data 8(4): 23:1-23:22 (2014) - [i4]Dóra Erdös, Vatche Ishakian, Azer Bestavros, Evimaria Terzi:
A Divide-and-Conquer Algorithm for Betweenness Centrality. CoRR abs/1406.4173 (2014) - 2013
- [c6]Dóra Erdös, Pauli Miettinen
Discovering facts with boolean tensor tucker decomposition. CIKM 2013: 1569-1572 - [c5]Dóra Erdös, Pauli Miettinen
Walk 'n' Merge: A Scalable Algorithm for Boolean Tensor Factorization. ICDM 2013: 1037-1042 - [c4]Dóra Erdös, Vatche Ishakian, Azer Bestavros
Repetition-aware content placement in navigational networks. KDD 2013: 820-828 - [i3]Dóra Erdös, Pauli Miettinen
Scalable Boolean Tensor Factorizations using Random Walks. CoRR abs/1310.4843 (2013) - 2012
- [j1]Dóra Erdös, Vatche Ishakian, Andrei Lapets
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity. Proc. VLDB Endow. 5(5): 418-429 (2012) - [c3]Dóra Erdös, Rainer Gemulla
Reconstructing Graphs from Neighborhood Data. ICDM 2012: 231-240 - [c2]Vatche Ishakian, Dóra Erdös, Evimaria Terzi, Azer Bestavros
A Framework for the Evaluation and Management of Network Centrality. SDM 2012: 427-438 - [i2]Dóra Erdös, Vatche Ishakian, Andrei Lapets, Evimaria Terzi, Azer Bestavros:
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity. CoRR abs/1201.6565 (2012) - [i1]Dóra Erdös, András Frank, Krisztián Kun:
Sink-Stable Sets of Digraphs. CoRR abs/1205.6071 (2012)
2000 – 2009
- 2009
- [c1]Dóra Erdös, Zsolt Fekete, András Lukács
Visualized subgraph search. IEEE VAST 2009: 267-268
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-04-25 05:43 CEST 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: