Your selections:
A complexity dichotomy for finding disjoint solutions of vertex deletion problems
- Fellows, Michael R., Guo, Jiong, Moser, Hannes, Niedermeier, Rolf
A family of irregular LDPC codes with low encoding complexity
- Johnson, Sarah J., Weller, Steven R.
A polynomially solvable case of the pooling problem
- Boland, Natashia, Kalinowski, Thomas, Rigterink, Fabian
Arc shutdown scheduling in a capacitated network to maximize flow over time
Editing graphs to satisfy degree constraints: a parameterized approach
- Mathieson, Luke, Szeider, Stefan
Equality of domination and transversal numbers in hypergraphs
- Arumugam, S., Jose, Bibin K., Bujtás, Csilla, Tuza, Zsolt
Graph editing problems with extended regularity constraints
Maintenance scheduling in a railway corridor
- Eskandarzadeh, Saman, Kalinowski, Thomas, Waterer, Hamish
Monitoring the Edges of a Graph Using Distances
- Foucaud, Florent, Klasing, Ralf, Miller, Mirka, Ryan, Joe
Moving horizon optimal quantizer for audio signals
- Goodwin, Graham C., Quevedo, Daniel E., McGrath, D.
Myopic coding in multiple relay channels
- Ong, Lawrence, Motani, Mehul
Scaling of the turbulent energy dissipation correlation function
- Tang, S. L., Antonia, R. A., Djenidi, L., Zhou, Y.
Scaling of turbulent velocity structure functions: plausibility constraints
- Djenidi, L., Antonia, R. A., Tang, S. L.
Scheduling problems arising in coal export supply chains: algorithms and complexity
Scheduling reclaimers serving a stock pad at a coal terminal
- Kalinowski, Thomas, Kapoor, Reena, Savelsbergh, Martin W. P.
Separating sets of strings by finding matching patterns is almost always hard
- Lancia, Giuseppe, Mathieson, Luke, Moscato, Pablo
Are you sure you would like to clear your session, including search history and login status?