Discrete Applied Mathematics

Title Titel
Discrete Applied Mathematics
 
e-ISSN
1872-6771
 
ISSN
0166-218X
 
Publisher Herausgeber
ELSEVIER
 
Publisher's Address Herausgeber Adresse
RADARWEG 29, AMSTERDAM, Netherlands, 1043 NX
 
Listed in SCI Aufgelistet im SCI
 
Peer reviewed Begutachtet
 
 

Publications Publikationen

Results 1-20 of 24 (Search time: 0.004 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Bjorklund, Henrik ; Vorobyov, Sergei A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff GamesArtikel Article 2007
2Creignou, Nadia ; Kröll, Markus ; Pichler, Reinhard ; Skritek, Sebastian ; Vollmer, Heribert A complexity theory for hard enumeration problemsArtikel Article 2019
3Panholzer, Alois A distributional study of the path edge-covering numbers for random treesArtikel Article 2008
4Klocker, Benedikt ; Fleischner, Herbert ; Raidl, Günther R. A model for finding transition-minorsArtikel Article 2020
5Ausserhofer, Markus ; Dann, Susanna ; Lángi, Zsolt ; Tóth, Géza An algorithm to find maximum area polygons circumscribed about a convex polygonArtikel Article 2019
6Kuba, Markus ; Mahmoud, Hosam ; Panholzer, Alois Analysis of a generalized Friedman's urn with multiple drawingsArtikel Article 2013
7Peitl-2023-Discrete Applied Mathematics-vor.pdf.jpgPeitl, Tomáš ; Szeider, Stefan Are hitting formulas hard for resolution?Article Artikel 15-Oct-2023
8Firbas, Alexander ; Dobler, Alexander ; Holzer, Fabian ; Schafellner, Jakob ; Sorge, Manuel ; Villedieu, Anaïs ; Monika Wißmann The complexity of cluster vertex splitting and companyArticle Artikel 15-Apr-2025
9Eiter, Thomas ; Makino, Kazuhisa ; Gottlob, Georg Computational Aspects of Monotone Dualization: A Brief SurveyArtikel Article 2008
10Vorobyov, Sergei Cyclic Games and Linear ProgrammingArtikel Article 2008
11Bliem, Bernhard ; Woltran, Stefan Defensive alliances in graphs of bounded treewidthArtikel Article 31-Dec-2018
12Ganian, Robert ; Hliněný, Petr ; Kneis, Joachim ; Langer, Alexander ; Obdržálek, Jan ; Rossmanith, Peter Digraph Width Measures in Parameterized AlgorithmicsArtikel Article 2014
13Engelmann, Viktor ; Ordyniak, Sebastian ; Kreutzer, Stephan Directed elimination gamesArtikel Article 2016
14Eiben, Eduard ; Ganian, Robert ; Szeider, Stefan Meta-kernelization using well-structured modulatorsArtikel Article 2018
15Blieberger, Johann Monotonically Labelled Motzkin TreesArtikel Article 1987
16Prosanov, Roman A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean spaceArtikel Article 2020
17Charron-Bost, Bernadette ; Függer, Matthias ; Nowak, Thomas New transience bounds for max-plus linear systemsArtikel Article 2017
18van ’t Hof, Pim ; Kamiński, Marcin ; Paulusma, Daniël ; Szeider, Stefan ; Thilikos, Dimitrios M. On Graph Contractions and Induced MinorsArtikel Article 2012
19Zeiner, Martin ; Schwarz, Manfred ; Schmid, Ulrich On Linear-Time Data Dissemination in Dynamic Rooted TreesArtikel Article 2019
20Eiben, Eduard ; Ganian, Robert ; Lauri, Juho On the Complexity of Rainbow Coloring ProblemsArtikel Article 2018