# Open Problems of the Lorentz Workshop \Enumeration Algorithms using Structure"

@inproceedings{Bodlaender2015OpenPO, title={Open Problems of the Lorentz Workshop \Enumeration Algorithms using Structure"}, author={Hans L. Bodlaender and Endre Boros and Pinar Heggernes and Dieter Kratsch}, year={2015} }

This is a collection of open problems presented at the Lorentz Workshop “Enumeration Algorithms using Structure” which took place at the Lorentz Center of the University of Leiden (The Netherlands), August 24 - 30, 2015. The workshop brought together researchers interested in various aspects of enumeration algorithms; in particular classical output-sensitive enumeration including output-polynomial and polynomial delay algorithms and the inputsensitive enumeration mainly dealing with exact… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-4 OF 4 CITATIONS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 16 REFERENCES

## The traveling salesman problem in bounded degree graphs

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## On the Number of Connected Sets in Bounded Degree Graphs

VIEW 1 EXCERPT

## Rank-width and vertex-minors

VIEW 2 EXCERPTS

## Speckenmeyerb On enumerating all minimal solutions of feedback problems

VIEW 1 EXCERPT

## Local Complementations of Simple and Directed Graphs

VIEW 2 EXCERPTS