default search action
Markus Iser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c16]Markus Iser
, Christoph Jabs
Global Benchmark Database. SAT 2024: 18:1-18:10 - [d4]Markus Iser
Global Benchmark Database. DROPS Artifacts, 2024 - [d3]Markus Iser
Global Benchmark Database (Extension Module). DROPS Artifacts, 2024 - [d2]Markus Iser
GBD Evaluation Scripts. DROPS Artifacts, 2024 - [d1]Markus Iser
GBD Data Repository. DROPS Artifacts, 2024 - [i5]Matthias Kern, Ferhat Erata, Markus Iser, Carsten Sinz, Frédéric Loiret, Stefan Otten, Eric Sax:
Integrating Static Code Analysis Toolchains. CoRR abs/2403.05986 (2024) - [i4]Markus Iser, Christoph Jabs:
Global Benchmark Database. CoRR abs/2405.10045 (2024) - [i3]Markus Iser:
Automated Explanation Selection for Scientific Discovery. CoRR abs/2407.17454 (2024) - 2023
- [c15]Matthias Gorenflo, Tomás Balyo, Markus Iser, Tobias Ostertag:
Decision Heuristics in a Constraint-based Product Configurator. ConfWS 2023: 51-59 - [c14]Maxim Popov, Tomás Balyo, Markus Iser, Tobias Ostertag:
Construction of Decision Diagrams for Product Configuration. ConfWS 2023: 108-117 - [c13]Markus Iser
Oracle-Based Local Search for Pseudo-Boolean Optimization. ECAI 2023: 1124-1131 - [c12]Tobias Fuchs
Active Learning for SAT Solver Benchmarking. TACAS (1) 2023: 407-425 - 2022
- [c11]Jakob Bach
A Comprehensive Study of k-Portfolios of Recent SAT Solvers. SAT 2022: 2:1-2:18 - [i2]Tim Holzenkamp, Kevin Kuryshev, Thomas Oltmann, Lucas Wäldele, Johann Zuber, Tobias Heuer, Markus Iser:
SATViz: Real-Time Visualization of Clausal Proofs. CoRR abs/2209.05838 (2022) - 2021
- [j2]Nils Froleyks
SAT Competition 2020. Artif. Intell. 301: 103572 (2021) - [c10]Johannes Werner, Tomás Balyo, Markus Iser, Michael Klein:
Fast Approximate Calculation of Valid Domains in a Satisfiability-based Product Configurator. ConfWS 2021: 24-32 - [c9]Markus Iser
Unit Propagation with Stable Watches (Short Paper). CP 2021: 6:1-6:8 - 2020
- [b1]Markus Iser:
Recognition and Exploitation of Gate Structure in SAT Solving. Karlsruhe Institute of Technology, Germany, 2020 - [i1]Markus Iser, Luca Springer, Carsten Sinz:
Collaborative Management of Benchmark Instances and their Attributes. CoRR abs/2009.02995 (2020)
2010 – 2019
- 2019
- [c8]Matthias Kern, Ferhat Erata
Integrating Static Code Analysis Toolchains. COMPSAC (1) 2019: 523-528 - [c7]Markus Iser
Memory Efficient Parallel SAT Solving with Inprocessing. ICTAI 2019: 64-70 - 2018
- [c6]Markus Iser, Carsten Sinz:
A Problem Meta-Data Library for Research in SAT. POS@SAT 2018: 144-152 - 2017
- [c5]Markus Iser, Felix Kutzner, Carsten Sinz:
Using Gate Recognition and Random Simulation for Under-Approximation and Optimized Branching in SAT Solvers. ICTAI 2017: 1029-1036 - 2016
- [j1]Tomás Balyo, Armin Biere
SAT Race 2015. Artif. Intell. 241: 45-65 (2016) - 2015
- [c4]Markus Iser, Norbert Manthey, Carsten Sinz:
Recognition of Nested Gates in CNF Formulas. SAT 2015: 255-271 - 2013
- [c3]Markus Iser
Minimizing Models for Tseitin-Encoded SAT Instances. SAT 2013: 224-232 - 2012
- [c2]Markus Iser, Mana Taghdiri, Carsten Sinz:
Optimizing MiniSAT Variable Orderings for the Relational Model Finder Kodkod - (Poster Presentation). SAT 2012: 483-484
2000 – 2009
- 2009
- [c1]Carsten Sinz, Markus Iser:
Problem-Sensitive Restart Heuristics for the DPLL Procedure. SAT 2009: 356-362
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: