BOUNDED TREEWIDTH
Experts
- Hans L. Bodlaender
- Dániel Marx
- Fedor V. Fomin
- Stefan Szeider
- Saket Saurabh
- Daniel Lokshtanov
- Michal Pilipczuk
- David R. Wood
- Daniël Paulusma
- Marcin Pilipczuk
- Ignasi Sau
- Markus Hecher
- Dimitrios M. Thilikos
- Erik D. Demaine
- Reinhard Pichler
- Petr A. Golovach
- Georg Gottlob
- Stefan Woltran
- Johannes Klaus Fichte
- Dieter Kratsch
- Édouard Bonnet
- Andreas Brandstädt
- Julien Baste
- David Eppstein
- Ton Kloks
- Yota Otachi
- M. S. Ramanujan
- Gwenaël Joret
- Zdenek Dvorák
- Robert Ganian
- Igor Razgon
- Marek Cygan
- L. Sunil Chandran
- Raffaele Mosca
- Matthew Johnson
- Pinar Heggernes
- Martin E. Dyer
- Ioan Todinca
- Martin Koutecký
Venues
- CoRR
- Discret. Appl. Math.
- Theor. Comput. Sci.
- Discret. Math.
- Algorithmica
- WG
- Inf. Process. Lett.
- SODA
- J. Graph Theory
- Electron. Colloquium Comput. Complex.
- SIAM J. Discret. Math.
- MFCS
- SIAM J. Comput.
- ESA
- ICALP
- J. Comput. Syst. Sci.
- FOCS
- Electron. J. Comb.
- STOC
- PODS
- IPEC
- Eur. J. Comb.
- Electron. Notes Discret. Math.
- Graphs Comb.
- STACS
- ISAAC
- AAAI
- Inf. Comput.
- J. Comb. Optim.
- J. Comb. Theory, Ser. B
- ICDT
- IACR Cryptol. ePrint Arch.
- Ars Comb.
- ACM Trans. Algorithms
- SAT
- IJCAI
- Random Struct. Algorithms
- J. Algorithms
- Comb.
Related Topics
Related Keywords
Popularity
No popularities found. Try to change the filters.
Popularity Trend