default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTilen Marc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Tilen Marc
:
Unlabeled sample compression schemes for oriented matroids. Discret. Math. 347(7): 114006 (2024)- 2023
- [j13]Kolja Knauer, Tilen Marc:
Corners and simpliciality in oriented matroids and partial cubes. Eur. J. Comb. 112: 103714 (2023) - 2022
- [c4]Karl Koch, Stephan Krenn, Tilen Marc, Stefan More, Sebastian Ramacher:
KRAKEN: a privacy-preserving data market for authentic data. DE@CoNEXT 2022: 15-20 - [c3]Jose Maria Bermudo Mera, Angshuman Karmakar, Tilen Marc, Azam Soleimanian:
Efficient Lattice-Based Inner-Product Functional Encryption. Public Key Cryptography (2) 2022: 163-193 - 2021
- [j12]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Tilen Marc, Balázs Patkós, Zsolt Tuza, Máté Vizer:
On Grundy total domination number in product graphs. Discuss. Math. Graph Theory 41(1): 225-247 (2021) - [j11]Milad Bahadori, Kimmo Järvinen, Tilen Marc, Miha Stopar:
Speed Reading in the Dark: Accelerating Functional Encryption for Quadratic Functions with Reprogrammable Hardware. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(3): 1-27 (2021) - [i12]Jose Maria Bermudo Mera, Angshuman Karmakar, Tilen Marc, Azam Soleimanian:
Efficient Lattice-Based Inner-Product Functional Encryption. IACR Cryptol. ePrint Arch. 2021: 46 (2021) - [i11]Hendrik Waldner, Tilen Marc, Miha Stopar, Michel Abdalla:
Private Stream Aggregation from Labeled Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2021: 81 (2021) - 2020
- [j10]Kolja Knauer, Tilen Marc:
On Tope Graphs of Complexes of Oriented Matroids. Discret. Comput. Geom. 63(2): 377-417 (2020) - [j9]Victor Chepoi, Kolja Knauer, Tilen Marc:
Hypercellular graphs: Partial cubes without Q3- as partial cube minor. Discret. Math. 343(4): 111678 (2020)
2010 – 2019
- 2019
- [c2]Tilen Marc, Miha Stopar, Jan Hartman, Manca Bizjak, Jolanda Modic:
Privacy-Enhanced Machine Learning with Functional Encryption. ESORICS (1) 2019: 3-21 - [c1]Miha Stopar, Manca Bizjak, Jolanda Modic, Jan Hartman, Anze Zitnik, Tilen Marc:
emmy - Trust-Enhancing Authentication Library. IFIPTM 2019: 133-146 - [i10]Sandi Klavzar, Kolja Knauer, Tilen Marc:
On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs. CoRR abs/1906.06111 (2019) - [i9]Tilen Marc, Miha Stopar, Jan Hartman, Manca Bizjak, Jolanda Modic:
Privacy-Enhanced Machine Learning with Functional Encryption. IACR Cryptol. ePrint Arch. 2019: 1129 (2019) - 2018
- [j8]Tilen Marc, Lovro Subelj:
Convexity in complex networks. Netw. Sci. 6(2): 176-203 (2018) - 2017
- [j7]Tilen Marc:
Mirror graphs: Graph theoretical characterization of reflection arrangements and finite Coxeter groups. Eur. J. Comb. 63: 115-123 (2017) - [j6]Tilen Marc:
Classification of Vertex-Transitive Cubic Partial Cubes. J. Graph Theory 86(4): 406-421 (2017) - [i8]Kolja Knauer, Tilen Marc:
On tope graphs of complexes of oriented matroids. CoRR abs/1701.05525 (2017) - 2016
- [j5]Tilen Marc:
There are no finite partial cubes of girth more than 6 and minimum degree at least 3. Eur. J. Comb. 55: 62-72 (2016) - [i7]Victor Chepoi, Kolja Knauer, Tilen Marc:
Partial cubes without $Q_3^-$ minors. CoRR abs/1606.02154 (2016) - [i6]Tilen Marc, Lovro Subelj:
On convexity in complex networks. CoRR abs/1608.03402 (2016) - [i5]Tilen Marc:
Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups. CoRR abs/1609.00591 (2016) - 2015
- [j4]Marc Hellmuth, Tilen Marc, Lydia Ostermeier, Peter F. Stadler:
The relaxed square property. Australas. J Comb. 62: 240- (2015) - [j3]Tilen Marc:
Vertex-transitive median graphs of non-exponential growth. Discret. Math. 338(3): 191-198 (2015) - [j2]Marc Hellmuth, Tilen Marc:
On the Cartesian skeleton and the factorization of the strong product of digraphs. Theor. Comput. Sci. 565: 16-29 (2015) - [i4]Tilen Marc:
There are no finite partial cubes of girth more than six and minimum degree at least three. CoRR abs/1503.04706 (2015) - [i3]Tilen Marc:
Classification of vertex-transitive cubic partial cubes. CoRR abs/1509.04565 (2015) - 2014
- [j1]Tilen Marc:
Regular median graphs of linear growth. Discret. Math. 324: 1-3 (2014) - [i2]Marc Hellmuth, Tilen Marc:
On the Cartesian Skeleton and the Factorization of the Strong Product of Digraphs. CoRR abs/1401.4965 (2014) - [i1]Marc Hellmuth, Tilen Marc, Lydia Ostermeier, Peter F. Stadler:
The Relaxed Square Property. CoRR abs/1407.3164 (2014)
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-01-20 22:54 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:
