Hans van Maaren

From MaRDI portal
Person:186236

Available identifiers

zbMath Open van-maaren.hansMaRDI QIDQ186236

List of research outcomes

PublicationDate of PublicationType
Improved solutions to the Steiner triple covering problem2016-06-09Paper
Theory and Applications of Satisfiability Testing2009-07-24Paper
Dynamic Symmetry Breaking by Simulating Zykov Contraction2009-07-07Paper
From Idempotent Generalized Boolean Assignments to Multi-bit Search2009-03-10Paper
Effective Incorporation of Double Look-Ahead Procedures2009-03-10Paper
https://portal.mardi4nfdi.de/entity/Q36040012009-02-24Paper
https://portal.mardi4nfdi.de/entity/Q36040022009-02-24Paper
Sums of squares based approximation algorithms for MAX-SAT2008-09-10Paper
Finding Guaranteed MUSes Fast2008-05-27Paper
https://portal.mardi4nfdi.de/entity/Q34291562007-03-30Paper
A new method to construct lower bounds for van der Waerden numbers2007-03-12Paper
Generation of classes of robust periodic railway timetables2006-05-16Paper
Theory and Applications of Satisfiability Testing2005-12-16Paper
Theory and Applications of Satisfiability Testing2005-12-16Paper
Theory and Applications of Satisfiability Testing2005-12-15Paper
Theory and Applications of Satisfiability Testing2005-12-15Paper
Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances2005-05-20Paper
Solving satisfiability problems using elliptic approximations. A note on volumes and weights2003-03-10Paper
On semidefinite programming relaxations of \((2+p)\)-SAT2003-03-10Paper
A short note on some tractable cases of the satisfiability problem.2003-01-14Paper
Simplicial pivoting algorithms for a tractable class of integer programs2002-05-28Paper
A Simplicial Approach to the Determination of an Integer Point of a Simplex2001-11-26Paper
https://portal.mardi4nfdi.de/entity/Q27498592001-10-21Paper
An arbitrary starting variable dimension algorithm for computing an integer point of a simplex2001-10-14Paper
Solving satisfiability problems using elliptic approximations -- effective branching rules2001-07-29Paper
Relaxations of the satisfiability problem using semidefinite programming2001-07-26Paper
A two-phase algorithm for solving a class of hard satisfiability problems2001-05-20Paper
Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT2001-02-18Paper
Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm2001-01-01Paper
Recognition of tractable satisfiability problems through balanced polynomial representations2000-03-20Paper
Elliptic approximations of propositional formulae2000-01-17Paper
https://portal.mardi4nfdi.de/entity/Q43757791998-06-02Paper
Pivoting algorithms based on Boolean vector labeling1998-04-13Paper
Inverse barriers and CES-functions in linear programming1998-01-15Paper
https://portal.mardi4nfdi.de/entity/Q39760991992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q52019091990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34798361987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37077671985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37324291985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39128501981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39212871981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39379471981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40431711974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Hans van Maaren