Andreas Emil Feldmann

Available identifiers

zbMath Open feldmann.andreas-emilMaRDI QIDQ344950

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6192486	2024-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q6147300	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6068263	2023-11-13	Paper
https://portal.mardi4nfdi.de/entity/Q6059176	2023-11-02	Paper
Generalized \(k\)-center: distinguishing doubling and highway dimension	2023-05-05	Paper
Parameterized inapproximability of independent set in \(H\)-free graphs	2023-04-11	Paper
https://portal.mardi4nfdi.de/entity/Q5874516	2023-02-07	Paper
FPT Inapproximability of Directed Cut and Connectivity Problems	2023-02-03	Paper
Parameterized inapproximability of independent set in \(H\)-free graphs	2022-12-21	Paper
Near-linear Time Approximation Schemes for Clustering in Doubling Metrics	2022-12-08	Paper
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems	2022-02-16	Paper
A note on the approximability of deepest-descent circuit steps	2021-12-13	Paper
Polynomial time approximation schemes for clustering in low highway dimension graphs	2021-09-17	Paper
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems	2021-08-04	Paper
Travelling on graphs with small highway dimension	2021-04-19	Paper
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices	2021-03-30	Paper
A Note on the Approximability of Deepest-Descent Circuit Steps	2020-10-21	Paper
The Parameterized Hardness of the k-Center Problem in Transportation Networks	2020-08-25	Paper
https://portal.mardi4nfdi.de/entity/Q3304124	2020-08-05	Paper
The parameterized hardness of the \(k\)-center problem in transportation networks	2020-05-21	Paper
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)	2020-03-27	Paper
Travelling on graphs with small highway dimension	2020-02-24	Paper
A tight lower bound for planar Steiner orientation	2019-06-27	Paper
Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs	2019-03-11	Paper
A tight lower bound for Steiner orientation	2018-11-28	Paper
A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs	2018-09-18	Paper
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem	2018-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4598163	2017-12-19	Paper
https://portal.mardi4nfdi.de/entity/Q2969617	2017-03-22	Paper
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree	2016-11-25	Paper
Lehman's Theorem and the Directed Steiner Tree Problem	2016-01-15	Paper
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs	2015-11-04	Paper
A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs	2015-10-27	Paper
On the parameterized complexity of computing balanced partitions in graphs	2015-09-04	Paper
Balanced partitions of trees and applications	2015-05-26	Paper
An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs	2015-03-02	Paper
Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games	2014-12-02	Paper
Fast balanced partitioning is hard even on grids and trees	2014-01-07	Paper
On the Parameterized Complexity of Computing Graph Bisections	2013-12-06	Paper
Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games	2013-06-07	Paper
Corner cuts are close to optimal: from solid grids to polygons and back	2013-04-25	Paper
Fast Balanced Partitioning Is Hard Even on Grids and Trees	2012-09-25	Paper
Computing approximate Nash equilibria in network congestion games	2012-09-21	Paper
https://portal.mardi4nfdi.de/entity/Q2904753	2012-08-23	Paper
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons	2011-12-16	Paper
An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs	2011-09-16	Paper
Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids	2011-01-08	Paper
Computing Approximate Nash Equilibria in Network Congestion Games	2008-07-10	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Andreas Emil Feldmann