Showing items 1 - 16 of 16

Your selections:

A complexity dichotomy for finding disjoint solutions of vertex deletion problems

A family of irregular LDPC codes with low encoding complexity

A polynomially solvable case of the pooling problem

Arc shutdown scheduling in a capacitated network to maximize flow over time

Editing graphs to satisfy degree constraints: a parameterized approach

Equality of domination and transversal numbers in hypergraphs

Graph editing problems with extended regularity constraints

Maintenance scheduling in a railway corridor

Monitoring the Edges of a Graph Using Distances

Moving horizon optimal quantizer for audio signals

Myopic coding in multiple relay channels

Scaling of the turbulent energy dissipation correlation function

Scaling of turbulent velocity structure functions: plausibility constraints

Scheduling problems arising in coal export supply chains: algorithms and complexity

Scheduling reclaimers serving a stock pad at a coal terminal

Separating sets of strings by finding matching patterns is almost always hard

  • 1
  • Disclaimer
  • Privacy
  • Copyright
  • Contact
  • Deposit