Your selections:
A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
A linear algorithm for a perfect matching in polyomino graphs
A novel parameterised approximation algorithm for minimum vertex cover
- Brankovic, Ljiljana, Fernau, Henning
Clustering with partial information
- Bodlaender, Hans L., Fellows, Michael R., Heggernes, Pinar, Mancini, Frederico, Papadopoulos, Charis, Rosamond, Frances
Fixed-parameter algorithms for Kemeny rankings
- Betzler, Nadja, Fellows, Michael R., Guo, Jiong, Niedermeier, Rolf, Rosamond, Frances A.
Graph editing problems with extended regularity constraints
Leakage-resilient biometric-based remote user authentication with fuzzy extractors
- Tian, Yangguang, Li, Yingjiu, Sengupta, Binanda, Li, Nan, Su, Chunhua
Linear-time superbubble identification algorithm for genome assembly
- Brankovic, Ljiljana, Iliopoulos, Costas S., Kundu, Ritu, Mohamed, Manal, Pissis, Solon P., Vayani, Fatima
- Prieto, Elena, Sloper, Christian
Mahler measures, short walks and log-sine integrals
- Borwein, Jonathan M., Straub, Armin
On finding short resolution refutations and small unsatisfiable subsets
- Fellows, Michael R., Szeider, Stefan, Wrightson, Graham
On the parameterized complexity of multiple-interval graph problems
- Fellows, Michael R., Hermelin, Danny, Rosamond, Frances, Vialette, Stéphane
Separating sets of strings by finding matching patterns is almost always hard
- Lancia, Giuseppe, Mathieson, Luke, Moscato, Pablo
- Wang, Mujiangshan, Lin, Yuqing, Wang, Shiying
The g-good-neighbor and g-extra diagnosability of networks
- Wang, Shiying, Wang, Mujiangshan
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.
Are you sure you would like to clear your session, including search history and login status?