Jump to:
B |
C |
F |
M |
N |
RNumber of items: 9.
B
Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas
(2021)
The Largest Connected Subgraph Game.
Bhattacharyya, Arnab and Bonnet, Édouard and Egri, László and Ghoshal, Suprovat and C. S., Karthik and Lin, Bingkai and Manurangsi, Pasin and Marx, Dániel
(2021)
Parameterized Intractability of Even Set and Shortest Vector Problem.
Journal of the ACM, 68 (3).
pp. 1-40.
ISSN 0004-5411
C
Cohen-Addad, Vincent and De Verdière, Éric Colin and Marx, Dániel and De Mesmay, Arnaud
(2021)
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs.
Journal of the ACM, 68 (4).
pp. 1-26.
ISSN 0004-5411
Cohen-Addad, Vincent and Klein, Philip N. and Marx, Dániel and Wheeler, Archer and Wolfram, Christopher
(2021)
On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting.
F
Focke, Jacob and Goldberg, Leslie Ann and Roth, Marc and Živný, Stanislav
(2021)
Counting Homomorphisms to K4-minor-free Graphs, modulo 2.
SIAM Journal on Discrete Mathematics, 35 (4).
pp. 2749-2814.
ISSN 0895-4801
M
Marx, Dániel
(2021)
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction.
Marx, Dániel and Sankar, Govind S. and Schepper, Philipp
(2021)
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth.
N
Neuen, Daniel
(2021)
Isomorphism Testing Parameterized by Genus and Beyond.
R
Rottenstreich, Ori and Kulik, Ariel and Joshi, Ananya and Rexford, Jennifer and Rétvári, Gábor and Menache, Daniel S
(2021)
Data Plane Cooperative Caching with Dependencies.
IEEE Transactions on Network and Service Management.
This list was generated on Sat Dec 21 09:24:53 2024 CET.