default search action
Konstantin Kutzkov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]George Tzougas, Konstantin Kutzkov:
Enhancing Logistic Regression Using Neural Networks for Classification in Actuarial Learning. Algorithms 16(2): 99 (2023) - [c16]Konstantin Kutzkov:
LoNe Sampler: Graph Node Embeddings by Coordinated Local Neighborhood Sampling. AAAI 2023: 8413-8420 - 2022
- [i11]Konstantin Kutzkov:
LoNe Sampler: Graph node embeddings by coordinated local neighborhood sampling. CoRR abs/2211.15114 (2022) - 2021
- [i10]Konstantin Kutzkov:
COLOGNE: Coordinated Local Graph Neighborhood Sampling. CoRR abs/2102.04770 (2021) - 2020
- [c15]David García-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis:
Query-Efficient Correlation Clustering. WWW 2020: 1468-1478 - [i9]David García-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis:
Query-Efficient Correlation Clustering. CoRR abs/2002.11557 (2020)
2010 – 2019
- 2018
- [c14]Moez Draief, Konstantin Kutzkov, Kevin Scaman, Milan Vojnovic:
KONG: Kernels for ordered-neighborhood graphs. NeurIPS 2018: 4055-4064 - [i8]Moez Draief, Konstantin Kutzkov, Kevin Scaman, Milan Vojnovic:
KONG: Kernels for ordered-neighborhood graphs. CoRR abs/1805.10014 (2018) - 2016
- [j5]Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh:
Triangle Counting in Dynamic Graph Streams. Algorithmica 76(1): 259-278 (2016) - [c13]Mathias Niepert, Mohamed Ahmed, Konstantin Kutzkov:
Learning Convolutional Neural Networks for Graphs. ICML 2016: 2014-2023 - [c12]Tian Guo, Konstantin Kutzkov, Mohamed Ahmed, Jean-Paul Calbimonte, Karl Aberer:
Efficient Distributed Decision Trees for Robust Regression. ECML/PKDD (2) 2016: 79-95 - [i7]Mathias Niepert, Mohamed Ahmed, Konstantin Kutzkov:
Learning Convolutional Neural Networks for Graphs. CoRR abs/1605.05273 (2016) - 2015
- [c11]Konstantin Kutzkov, Mohamed Ahmed, Sofia Nikitaki:
Weighted Similarity Estimation in Data Streams. CIKM 2015: 1051-1060 - 2014
- [j4]Alexander Golovnev, Konstantin Kutzkov:
New exact algorithms for the 2-constraint satisfaction problem. Theor. Comput. Sci. 526: 18-27 (2014) - [c10]David García-Soriano, Konstantin Kutzkov:
Triangle counting in streamed graphs via small vertex covers. SDM 2014: 352-360 - [c9]Konstantin Kutzkov, Rasmus Pagh:
Consistent Subset Sampling. SWAT 2014: 294-305 - [c8]Konstantin Kutzkov, Rasmus Pagh:
Triangle Counting in Dynamic Graph Streams. SWAT 2014: 306-318 - [i6]Konstantin Kutzkov, Rasmus Pagh:
Consistent Subset Sampling. CoRR abs/1404.4693 (2014) - [i5]Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh:
Triangle counting in dynamic graph streams. CoRR abs/1404.4696 (2014) - 2013
- [c7]Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh:
On parallelizing matrix multiplication by the column-row method. ALENEX 2013: 122-132 - [c6]Konstantin Kutzkov, Albert Bifet, Francesco Bonchi, Aristides Gionis:
STRIP: stream learning of influence probabilities. KDD 2013: 275-283 - [c5]Konstantin Kutzkov:
Deterministic algorithms for skewed matrix products. STACS 2013: 466-477 - [c4]Konstantin Kutzkov, Rasmus Pagh:
On the streaming complexity of computing local clustering coefficients. WSDM 2013: 677-686 - [i4]Francesco Bonchi, David García-Soriano, Konstantin Kutzkov:
Local correlation clustering. CoRR abs/1312.5105 (2013) - 2012
- [j3]Konstantin Kutzkov:
An exact exponential time algorithm for counting bipartite cliques. Inf. Process. Lett. 112(13): 535-539 (2012) - [c3]Konstantin Kutzkov:
Improved Counter Based Algorithms for Frequent Pairs Mining in Transactional Data Streams. ECML/PKDD (1) 2012: 843-858 - [i3]Konstantin Kutzkov:
Deterministic algorithms for skewed matrix products. CoRR abs/1209.4508 (2012) - [i2]Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh:
On Parallelizing Matrix Multiplication by the Column-Row Method. CoRR abs/1210.0461 (2012) - 2011
- [c2]Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh:
Frequent Pairs in Data Streams: Exploiting Parallelism and Skew. ICDM Workshops 2011: 145-150 - 2010
- [i1]Konstantin Kutzkov, Dominik Scheder:
Using CSP To Improve Deterministic 3-SAT. CoRR abs/1007.1166 (2010)
2000 – 2009
- 2007
- [j2]Konstantin Kutzkov:
New upper bound for the #3-SAT problem. Inf. Process. Lett. 105(1): 1-5 (2007) - [c1]Alexander S. Kulikov, Konstantin Kutzkov:
New Bounds for MAX-SAT by Clause Learning. CSR 2007: 194-204 - 2006
- [j1]Konstantin Kutzkov:
A Note on the Use of Independent Sets for the k-SAT Problem. J. Satisf. Boolean Model. Comput. 1(2): 143-145 (2006)
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-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint