Search Results - Penninkx, Eelko

  • Showing 1 - 5 results of 5
Refine Results
  1. 1
    Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

    Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions by Dorn, Frederic, Penninkx, Eelko, Bodlaender, Hans L., Fomin, Fedor V.

    Published in Algorithmica
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    (Meta) Kernelization

    (Meta) Kernelization by Bodlaender, Hans L, Fomin, Fedor V, Lokshtanov, Daniel, Penninkx, Eelko, Saurabh, Saket, Thilikos, Dimitrios M

    Published in Journal of the ACM
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    On the minimum corridor connection problem and other generalized geometric problems

    On the minimum corridor connection problem and other generalized geometric problems by Bodlaender, Hans L., Feremans, Corinne, Grigoriev, Alexander, Penninkx, Eelko, Sitters, René, Wolle, Thomas

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  4. 4
    (Meta) Kernelization

    (Meta) Kernelization by Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  5. 5
    (Meta) Kernelization

    (Meta) Kernelization by Bodlaender, Hans L, Fomin, Fedor V, Lokshtanov, Daniel, Penninkx, Eelko, Saket Saurabh, Thilikos, Dimitrios M

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: