default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBojana Kodric
Person information
- affiliation: Ca' Foscari University of Venice, Italy
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric
, Riccardo Maso, Nicola Prezza:
Random Wheeler Automata. CPM 2024: 5:1-5:15- [c17]Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza:
Sketching and Streaming for Dictionary Compression. DCC 2024: 213-222 - [i11]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Tomasz Kociumaka, Bojana Kodric, Alberto Policriti, Nicola Prezza:
On the Complexity of Computing the Co-lexicographic Width of a Regular Language. CoRR abs/2410.04771 (2024) - 2023
- [c16]Simone Fioravanti, Michele Flammini, Bojana Kodric, Giovanna Varricchio:
PAC Learning and Stabilizing Hedonic Games: Towards a Unifying Approach. AAAI 2023: 5641-5648 - [c15]Alessandro Aloisio, Michele Flammini, Bojana Kodric, Cosimo Vinci:
Distance Polymatrix Coordination Games (short paper). IPS-RCRA-SPIRIT@AI*IA 2023 - [c14]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev:
Giant Components in Random Temporal Graphs. APPROX/RANDOM 2023: 29:1-29:17 - [c13]Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza:
Sorting Finite Automata via Partition Refinement. ESA 2023: 15:1-15:15 - [c12]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Testing Wheelerness of Regular Languages (short paper) (text not included). ICTCS 2023 - [c11]Simone Fioravanti, Michele Flammini, Bojana Kodric, Giovanna Varricchio:
ε-fractional core stability in Hedonic Games. NeurIPS 2023 - [c10]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Optimal Wheeler Language Recognition. SPIRE 2023: 62-74 - [c9]Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, Bojana Kodric:
Proxying Betweenness Centrality Rankings in Temporal Networks. SEA 2023: 6:1-6:22 - [i10]Simone Fioravanti, Michele Flammini, Bojana Kodric, Giovanna Varricchio:
PAC learning and stabilizing Hedonic Games: towards a unifying approach. CoRR abs/2301.13756 (2023) - [i9]Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza:
Sorting Finite Automata via Partition Refinement. CoRR abs/2305.05129 (2023) - [i8]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Optimal Wheeler Language Recognition. CoRR abs/2306.04737 (2023) - [i7]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza:
Random Wheeler Automata. CoRR abs/2307.07267 (2023) - [i6]Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza:
Sketching and Streaming for Dictionary Compression. CoRR abs/2310.17980 (2023) - [i5]Simone Fioravanti, Michele Flammini, Bojana Kodric, Giovanna Varricchio:
ε-fractional Core Stability in Hedonic Games. CoRR abs/2311.11101 (2023) - 2022
- [j3]Michele Flammini, Bojana Kodric, Giovanna Varricchio:
Strategyproof mechanisms for Friends and Enemies Games. Artif. Intell. 302: 103610 (2022) - [i4]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev:
Giant Components in Random Temporal Graphs. CoRR abs/2205.14888 (2022) - 2021
- [j2]Michele Flammini, Bojana Kodric, Gianpiero Monaco, Qiang Zhang:
Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games. J. Artif. Intell. Res. 70: 1253-1279 (2021) - [c8]Alessandro Aloisio, Michele Flammini, Bojana Kodric, Cosimo Vinci:
Distance Polymatrix Coordination Games. IJCAI 2021: 3-9 - [c7]Michele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio:
Distance Hedonic Games. SOFSEM 2021: 159-174 - 2020
- [j1]Kouki Matsumura, Bojana Kodric, Tenda Okimoto, Katsutoshi Hirayama:
Two approximation algorithms for probabilistic coalition structure generation with quality bound. Auton. Agents Multi Agent Syst. 34(1): 25 (2020) - [c6]Michele Flammini, Bojana Kodric, Giovanna Varricchio:
Strategyproof Mechanisms for Friends and Enemies Games. AAAI 2020: 1950-1957 - [c5]Michele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio:
Distance Hedonic Games. AAMAS 2020: 1846-1848
2010 – 2019
- 2018
- [c4]Thomas Kesselheim, Bojana Kodric:
Price of Anarchy for Mechanisms with Risk-Averse Agents. ICALP 2018: 155:1-155:14 - [i3]Thomas Kesselheim, Bojana Kodric:
Price of Anarchy for Mechanisms with Risk-Averse Agents. CoRR abs/1804.09468 (2018) - 2017
- [b1]Bojana Kodric:
Incentives in dynamic markets. Saarland University, Germany, 2017 - [c3]Martin Hoefer, Bojana Kodric:
Combinatorial Secretary Problems with Ordinal Information. ICALP 2017: 133:1-133:14 - [i2]Martin Hoefer, Bojana Kodric:
Combinatorial Secretary Problems with Ordinal Information. CoRR abs/1702.01290 (2017) - 2016
- [c2]Martin Hoefer, Thomas Kesselheim, Bojana Kodric:
Smoothness for Simultaneous Composition of Mechanisms with Admission. WINE 2016: 294-308 - 2015
- [i1]Martin Hoefer, Thomas Kesselheim, Bojana Kodric:
Smoothness for Simultaneous Composition of Mechanisms with Admission. CoRR abs/1509.00337 (2015) - 2013
- [c1]Benjamin Doerr, Bojana Kodric, Marco Voigt:
Lower bounds for the runtime of a global multi-objective evolutionary algorithm. IEEE Congress on Evolutionary Computation 2013: 432-439
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-09 12: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:
