Your selections:
Quantifying privacy: a novel entropy-based measure of disclosure risk
- Alfalayleh, Mousa, Brankovic, Ljiljana
- Aljamea, Moudhi M., Brankovic, Ljiljana, Gao, Jia, Iliopoulos, Costas S., Samiruzzaman, M.
A survey of face-antimagic evaluations of graphs
- Baca, Martin, Baskoro, Edy, Brankovic, Ljiljana, Jendrol', Stanislav, Lin, Yuqing, Phanalasy, Oudone, Ryan, Joe, Semanicova-Fenovcikova, Andrea, Slamin, Sugeng, Kiki A.
On d-antimagic labelings of plane graphs
- Baca, Martin, Brankovic, Ljiljana, Lascsakova, Marcela, Phanalasy, Oudone, Semanicova-Fenovciova, Andrea
On the complexity landscape of the domination chain
- Bazgan, Cristina, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning
The many facets of upper domination
- Bazgan, Cristina, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning, Jansen, Klaus, Klein, Kim-Manuel, Lampis, Michael, Liedloff, Mathieu, Monnot, Jérôme, Paschos, Vangelis Th.
- Bazgan, Cristina, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning
Algorithmic aspects of upper domination: a parameterised perspective
- Bazgan, Cristina, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning, Jansen, Klaus, Klein, Kim-Manuel, Lampis, Michael, Liedloff, Mathieu, Monnot, Jérôme, Paschos, Vangelis Th.
Upper domination: complexity and approximation
- Bazgan, Cristina, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning, Jansen, Klaus, Klein, Kim-Manuel, Lampis, Michael, Liedloff, Mathieu, Monnot, Jérôme, Paschos, Vangelis Th.
Edge-antimagicness for a class of disconnected graphs
- Bača, Martin, Brankovic, Ljiljana
Labelings of plane graphs with determined face weights
- Bača, Martin, Brankovic, Ljiljana, Semaničová-Feňovčíková, Andrea
Labelings of plane graphs containing Hamilton Path
- Bača, Martin, Brankovic, Ljiljana, Semaničová-Feňovčíková, Andrea
Breaking the 2ⁿ-barrier for irredundance: two lines of attack
- Binkele-Raible, Daniel, Brankovic, Ljiljana, Wojtaszczyk, Jakub Onufry, Cygan, Marek, Fernau, Henning, Kneis, Joachim, Kratsch, Dieter, Langer, Alexander, Liedloff, Mathieu, Pilipczuk, Marcin, Rossmanith, Peter
A parameterized route to exact puzzles: breaking the 2n-barrier for irredundance
- Binkele-Raible, Daniel, Brankovic, Ljiljana, Fernau, Henning, Kneis, Joachim, Kratsch, Dieter, Langer, Alexander, Liedloff, Mathieu, Rossmanith, Peter
Approximability of a {0,1} - matrix problem
- Brankovic, Ljiljana, Fernau, Henning
A novel parameterised approximation algorithm for minimum vertex cover
- Brankovic, Ljiljana, Fernau, Henning
Premature partial Latin squares
- Brankovic, Ljiljana, Horak, Peter, Miller, Mirka, Rosa, Alexander
On range query usability of statistical databases
- Brankovic, Ljiljana, Miller, Mirka, Siran, Jozef
Teaching advanced computing technologies to managers, engineers and other professionals
- Brankovic, Ljiljana, Chalup, Stephan, Wallis, Mark
Parameterized approximation algorithms for HITTING SET
- Brankovic, Ljiljana, Fernau, Henning
Are you sure you would like to clear your session, including search history and login status?