Robert Crowston

According to our database1, Robert Crowston authored at least 23 papers between 2010 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Parameterizations of Test Cover with Bounded Test Sizes.
Algorithmica, 2016

2015
Max-Cut Parameterized Above the Edwards-Erdős Bound.
Algorithmica, 2015

2014
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach.
J. Comput. Syst. Sci., 2014

Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables.
Algorithmica, 2014

2013
Algorithms for parameterized constraint satisfaction problems.
PhD thesis, 2013

Parameterized complexity of MaxSat Above Average.
Theor. Comput. Sci., 2013

Maximum balanced subgraph problem parameterized above lower bound.
Theor. Comput. Sci., 2013

Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$.
Theory Comput. Syst., 2013

Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound.
CoRR, 2013

Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
Parameterized Eulerian strong component arc deletion problem on tournaments.
Inf. Process. Lett., 2012

Directed Acyclic Subgraph Problem Parameterized above Raman-Saurabh Bound
CoRR, 2012

A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications.
Algorithmica, 2012

Parameterized Study of the Test Cover Problem.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$
CoRR, 2011

Lower Bound for Max-$r$-Lin2 and its Applications in Algorithmics and Graph Theory
CoRR, 2011

Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010
Note on Max Lin-2 above Average.
Inf. Process. Lett., 2010

Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation
CoRR, 2010

Systems of Linear Equations over F<sub>2</sub> and Problems Parameterized above Average.
Proceedings of the Algorithm Theory, 2010

A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010


  Loading...