default search action
Theoretical Computer Science, Volume 676
Volume 676, May 2017
- James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
MSOL restricted contractibility to planar graphs. 1-14 - Palash Dey, Neeldhara Misra, Y. Narahari:
Frugal bribery in voting. 15-32 - Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff:
Exact exponential algorithms to find tropical connected sets of minimum size. 33-41 - Janka Chlebíková, Morgan Chopin:
The firefighter problem: Further steps in understanding its complexity. 42-51 - Zhenyu Huang, Dongdai Lin:
Solving polynomial systems with noise over F2: Revisited. 52-68 - Lucy Ham:
Gap theorems for robust satisfiability: Boolean CSPs and beyond. 69-91
- Mariana V. Badano, Diego Vaggione:
Characterization of context-free languages. 92-96
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.