VLDB 2026 Research / reviewers in the wild / expert
Jozef Sirán
dblp:07/1664
· DBLP profile ↗
5ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 1 since 2021Artificial intelligence and machine learning · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Clique-partitioned graphsabstractA graph G of order nv where n≥2 and v≥2 is said to be weakly (n,v)-clique-partitioned if its vertex set can be decomposed in a unique way into n vertex-disjoint v-cliques. It is strongly (n,v)-clique-partitioned if in addition, the only v-cliques of G are the n cliques in the decomposition. We determine the structure of such graphs which have the largest possible number of edges. Grahame Erskine, Terry S. Griggs, Jozef Sirán |
Discret. Appl. Math. | 3 |
| 2019 | An algebraic approach to lifts of digraphs
Cristina Dalfó, Miguel Angel Fiol, Mirka Miller, Joseph F. Ryan 0001, Jozef Sirán |
Discret. Appl. Math. | 5 |
| 2017 | On the existence of aggregation functions with given super-additive and sub-additive transformations
Alexandra Siposová, Ladislav Sipeky, Jozef Sirán |
Fuzzy Sets Syst. | 3 |
| 2002 | 2-Compromise Usability in 1-Dimensional Statistical Databases
Ljiljana Brankovic, Jozef Sirán |
COCOON | 2 |
| 2002 | Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs
Sangho Shim, Jozef Sirán, Janez Zerovnik |
Discret. Appl. Math. | 2 |