default search action
Çigdem Aslay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c14]Andrew Draganov, Jakob Rødsgaard Jørgensen, Katrine Scheel, Davide Mottin, Ira Assent, Tyrus Berry, Çigdem Aslay:
ActUp: Analyzing and Consolidating tSNE and UMAP. IJCAI 2023: 3651-3658 - [i11]Andrew Draganov, Jakob Rødsgaard Jørgensen, Katrine Scheel Nellemann, Davide Mottin, Ira Assent, Tyrus Berry, Çigdem Aslay:
ActUp: Analyzing and Consolidating tSNE and UMAP. CoRR abs/2305.07320 (2023) - 2022
- [j4]Antonis Matakos, Çigdem Aslay
, Esther Galbrun
Maximizing the Diversity of Exposure in a Social Network. IEEE Trans. Knowl. Data Eng. 34(9): 4357-4370 (2022) - [c13]Martino Ciaperoni, Çigdem Aslay
Workload-Aware Materialization of Junction Trees. EDBT 2022: 1:65-1:77 - 2021
- [j3]Muhammad Anis Uddin Nasir, Çigdem Aslay
TipTap: Approximate Mining of Frequent k-Subgraph Patterns in Evolving Graphs. ACM Trans. Knowl. Discov. Data 15(3): 48:1-48:35 (2021) - [c12]Corrado Monti, Giuseppe Manco
Learning Ideological Embeddings from Information Cascades. CIKM 2021: 1325-1334 - [c11]Çigdem Aslay
Workload-aware Materialization for Efficient Variable Elimination on Bayesian Networks. ICDE 2021: 1152-1163 - [c10]Kai Han, Benwei Wu, Jing Tang
Efficient and Effective Algorithms for Revenue Maximization in Social Advertising. SIGMOD Conference 2021: 671-684 - [i10]Kai Han, Benwei Wu, Jing Tang, Shuang Cui, Çigdem Aslay, Laks V. S. Lakshmanan:
Efficient and Effective Algorithms for Revenue Maximization in Social Advertising. CoRR abs/2107.04997 (2021) - [i9]Corrado Monti, Giuseppe Manco, Çigdem Aslay, Francesco Bonchi:
Learning Ideological Embeddings from Information Cascades. CoRR abs/2109.13589 (2021) - [i8]Martino Ciaperoni, Çigdem Aslay, Aristides Gionis, Michael Mathioudakis:
Workload-Aware Materialization of Junction Trees. CoRR abs/2110.03475 (2021) - 2020
- [c9]Sijing Tu, Çigdem Aslay, Aristides Gionis:
Co-exposure Maximization in Online Social Networks. NeurIPS 2020
2010 – 2019
- 2019
- [c8]Florian Adriaens, Çigdem Aslay, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt
Discovering Interesting Cycles in Directed Graphs. CIKM 2019: 1191-1200 - [i7]Çigdem Aslay, Aristides Gionis, Michael Mathioudakis:
Query the model: precomputations for efficient inference with Bayesian Networks. CoRR abs/1904.00079 (2019) - [i6]Florian Adriaens, Çigdem Aslay, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt:
Discovering Interesting Cycles in Directed Graphs. CoRR abs/1909.01060 (2019) - 2018
- [c7]Çigdem Aslay, Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, Aristides Gionis:
Mining Frequent Patterns in Evolving Graphs. CIKM 2018: 923-932 - [c6]Han Xiao, Çigdem Aslay, Aristides Gionis:
Robust Cascade Reconstruction by Steiner Tree Sampling. ICDM 2018: 637-646 - [c5]Çigdem Aslay, Antonis Matakos, Esther Galbrun, Aristides Gionis:
Maximizing the Diversity of Exposure in a Social Network. ICDM 2018: 863-868 - [c4]Çigdem Aslay, Laks V. S. Lakshmanan, Wei Lu, Xiaokui Xiao
Influence Maximization in Online Social Networks. WSDM 2018: 775-776 - [i5]Çigdem Aslay, Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, Aristides Gionis:
Mining Frequent Patterns in Evolving Graphs. CoRR abs/1809.00394 (2018) - [i4]Çigdem Aslay, Antonis Matakos, Esther Galbrun, Aristides Gionis:
Maximizing the Diversity of Exposure in a Social Network. CoRR abs/1809.04393 (2018) - [i3]Han Xiao, Çigdem Aslay, Aristides Gionis:
Robust Cascade Reconstruction by Steiner Tree Sampling. CoRR abs/1809.05812 (2018) - 2017
- [j2]Çigdem Aslay, Francesco Bonchi, Laks V. S. Lakshmanan, Wei Lu:
Revenue Maximization in Incentivized Social Advertising. Proc. VLDB Endow. 10(11): 1238-1249 (2017) - [c3]Dong Zheng, Jianquan Liu, Rong-Hua Li, Çigdem Aslay, Yi-Cheng Chen, Xin Huang
Querying Intimate-Core Groups in Weighted Graphs. ICSC 2017: 156-163 - 2016
- [b1]Çigdem Aslay:
From viral marketing to social advertising: ad allocation under social influence. Pompeu Fabra University, Spain, 2016 - [i2]Çigdem Aslay, Francesco Bonchi, Laks V. S. Lakshmanan, Wei Lu:
Revenue Maximization in Incentivized Social Advertising. CoRR abs/1612.00531 (2016) - 2015
- [j1]Çigdem Aslay, Wei Lu, Francesco Bonchi, Amit Goyal, Laks V. S. Lakshmanan:
Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret. Proc. VLDB Endow. 8(7): 822-833 (2015) - 2014
- [c2]Çigdem Aslay, Nicola Barbieri, Francesco Bonchi, Ricardo Baeza-Yates
Online Topic-aware Influence Maximization Queries. EDBT 2014: 295-306 - [i1]Çigdem Aslay, Wei Lu, Francesco Bonchi, Amit Goyal, Laks V. S. Lakshmanan:
Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret. CoRR abs/1412.1462 (2014) - 2013
- [c1]Çigdem Aslay, Neil O'Hare, Luca Maria Aiello
Competition-based networks for expert finding. SIGIR 2013: 1033-1036
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-05-08 21:03 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: