Martin Nägele

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint types under which SFM remains efficiently solvable. The arguably most relevant non-trivial constraint class for which(More)
The polymerase chain reaction-restriction fragment length polymorphism technique (PCR-RFLP) was used to compare Rhodnius domesticus (Neiva & Pinto), R. pictipes (Stal), R. prolixus (Stal) and R. stali (Lent, Jurberg & Galvão) (Hemiptera: Reduviidae). The enzyme BstUI differentiated R. domesticus, R. pictipes and R. prolixus, and HhaI differentiated R.(More)
  • 1