Discrete Applied Mathematics - researchr journal

1	--	0	Lefteris M. Kirousis, Evangelos Kranakis. Special Issue on Typical Case Complexity and Phase Transitions
3	--	24	Adam Beacham, Joseph C. Culberson. On the complexity of unfrozen problems
25	--	47	Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore. The resolution complexity of random graph ::::k::::-colorability
48	--	57	Nadia Creignou, Hervé Daudé, John V. Franco. A sharp threshold for the renameable-Horn and the q-Horn properties
58	--	72	Tassos Dimitriou. SAT distributions with planted assignments and phase transitions between decision and optimization problems
73	--	88	András Faragó. On the typical case complexity of graph optimization
89	--	123	John V. Franco. Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
124	--	140	Yong Gao, Joseph C. Culberson. Resolution complexity of random constraint satisfaction problems: Another half of the story
141	--	152	Gabriel Istrate. Threshold properties of random boolean constraint satisfaction problems
153	--	181	Ulrich Voll. A novel giant-subgraph phase-transition in sparse random ::::k::::-partite graphs

External Links