Cygan - PDFSEARCH.IO - Document Search Engine

Cygan
Results: 31

#	Item
1	A On Problems as Hard as CNF-SAT1 Marek Cygan, University of Warsaw, Poland. . Holger Dell, Saarland University and Cluster of Excellence (MMCI), Germany. . Daniel Lokshtanov, Add to Reading List Source URL: www.cs.bme.hu Language: English - Date: 2017-03-08 07:42:33
2	Minicourse on parameterized algorithms and complexity Part 2: Iterative compression D´aniel Marx (slides by Marek Cygan) Add to Reading List Source URL: www.cs.bme.hu Language: English - Date: 2015-04-20 06:40:50
3	Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable∗ Rajesh Chitnis†1 , Marek Cygan‡2 , MohammadTaghi Hajiaghayi§1 and D´aniel Marx¶3 1 Department of Computer Science, University of Maryland at Coll Add to Reading List Source URL: www.cs.bme.hu Language: English - Date: 2014-11-30 16:18:48
4	Open problems for FPT School 2014 Marek Cygan Daniel Lokshtanov Fedor Fomin Bart M.P. Jansen Add to Reading List Source URL: fptschool.mimuw.edu.pl Language: English - Date: 2014-09-01 05:21:21
5	Basic Techniques II: Iterative Compression Marek Cygan Institute of Informatics University of Warsaw Add to Reading List Source URL: fptschool.mimuw.edu.pl Language: English - Date: 2014-08-18 06:58:34
6	How to Sell Hyperedges: The Hypermatching Assignment Problem∗ Marek Cygan Fabrizio Grandoni Add to Reading List Source URL: people.idsia.ch Language: English - Date: 2012-10-01 15:09:03
7	Goldschmidt 2000 September 3rd–8th, 2000 Oxford, UK. Journal of Conference Abstracts Volume 5(2), 487 Add to Reading List Source URL: www.the-conference.com Language: English - Date: 2009-11-05 06:41:04 Engines Speciation Stoichiometry Molecular dynamics Cygan Chemistry Chemical engineering Air–fuel ratio
8	On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-03-27 21:09:14 NP-complete problems Exponential time hypothesis Conjunctive normal form Boolean satisfiability problem Vertex cover Set cover problem Time complexity Graph coloring Independent set Theoretical computer science Computational complexity theory Applied mathematics
9	Algorithms for Three Versions of the Shortest Common Superstring Problem Maxime Crochemore, Marek Cygan, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2010-08-20 17:45:58 Superstring theory Computer science Mathematics Computational complexity theory Approximation algorithm NP-complete
10	a-cygan.vp:CorelVentura 7.0 Add to Reading List Source URL: www.isez.pan.krakow.pl Language: English - Date: 2014-08-01 08:50:06 Ore Hair analysis Science Medicine Biology Chelates in animal nutrition Nutrition Dietary mineral Food science

UPDATE