Abstract: Weighted vertex cover (WVC) problem, as one of the most important combinatorial optimization problems, is a general form of the classic vertex cover problem. The existing researches focused ...

Guaranteed-Quality Anisotropic Mesh Generation. If you're in Soda Hall, you'll find copies of most of my papers hanging outside my office (625). Take the ones you want. FAR AND AWAY MY MOST POPULAR ...

The US Cybersecurity and Infrastructure Security Agency (CISA) has released a new advisory mapping post-quantum cryptography (PQC) standards to common enterprise hardware and software categories, ...

Abstract: The minimum vertex cover (MVC) is a well-known combinatorial optimization problem. A game-based memetic algorithm (GMA-MVC) is provided, in which the local search is an asynchronous updating ...

This is the open source project KaMIS - Karlsruhe Maximum Independent Sets. Given a graph G=(V,E), the goal of the maximum independent set problem is to compute a maximum cardinality set of vertices I ...

This study addresses the challenge of efficiently and accurately computing three-dimensional undulating surface magnetic field data, which has become increasingly difficult with the development of ...

Between December 2020 and July 2022, we conducted a 52-week, open-label, single-arm trial of 100 adults aged 18–75 with asthma, with 25 patients each on Global Initiative for Asthma 2018 treatment ...

We develop scalable algorithms for independence problems on graphs: Maximum Independent Set (MIS), Maximum Weight Independent Set (MWIS), 2-Packing Set, and Vertex Cover. Developed at the Algorithm ...