23 research outputs found
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
LIPIcs, Volume 274, ESA 2023, Complete Volume
LIPIcs, Volume 274, ESA 2023, Complete Volum
LIPIcs, Volume 258, SoCG 2023, Complete Volume
LIPIcs, Volume 258, SoCG 2023, Complete Volum
International Workshop on Finite Elements for Microwave Engineering
When Courant prepared the text of his 1942 address to the American Mathematical Society for publication, he added a two-page Appendix to illustrate how the variational methods first described by Lord Rayleigh could be put to wider use in potential theory. Choosing piecewise-linear approximants on a set of triangles which he called elements, he dashed off a couple of two-dimensional examples and the finite element method was born. … Finite element activity in electrical engineering began in earnest about 1968-1969. A paper on waveguide analysis was published in Alta Frequenza in early 1969, giving the details of a finite element formulation of the classical hollow waveguide problem. It was followed by a rapid succession of papers on magnetic fields in saturable materials, dielectric loaded waveguides, and other well-known boundary value problems of electromagnetics. … In the decade of the eighties, finite element methods spread quickly. In several technical areas, they assumed a dominant role in field problems. P.P. Silvester, San Miniato (PI), Italy, 1992 Early in the nineties the International Workshop on Finite Elements for Microwave Engineering started. This volume contains the history of the Workshop and the Proceedings of the 13th edition, Florence (Italy), 2016 . The 14th Workshop will be in Cartagena (Colombia), 2018
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Volume 244, ESA 2022, Complete Volum
LIPIcs, Volume 248, ISAAC 2022, Complete Volume
LIPIcs, Volume 248, ISAAC 2022, Complete Volum
Grid Recognition: Classical and Parameterized Computational Perspectives
Grid graphs, and, more generally, grid graphs, form one of the
most basic classes of geometric graphs. Over the past few decades, a large body
of works studied the (in)tractability of various computational problems on grid
graphs, which often yield substantially faster algorithms than general graphs.
Unfortunately, the recognition of a grid graph is particularly hard -- it was
shown to be NP-hard even on trees of pathwidth 3 already in 1987. Yet, in this
paper, we provide several positive results in this regard in the framework of
parameterized complexity (additionally, we present new and complementary
hardness results). Specifically, our contribution is threefold. First, we show
that the problem is fixed-parameter tractable (FPT) parameterized by where is the maximum size of a connected component of
. This also implies that the problem is FPT parameterized by
where is the treedepth of (to be compared with the hardness
for pathwidth 2 where ). Further, we derive as a corollary that strip
packing is FPT with respect to the height of the strip plus the maximum of the
dimensions of the packed rectangles, which was previously only known to be in
XP. Second, we present a new parameterization, denoted , relating graph
distance to geometric distance, which may be of independent interest. We show
that the problem is para-NP-hard parameterized by , but FPT parameterized
by on trees, as well as FPT parameterized by . Third, we show that
the recognition of grid graphs is NP-hard on graphs of pathwidth 2
where . Moreover, when and are unrestricted, we show that the
problem is NP-hard on trees of pathwidth 2, but trivially solvable in
polynomial time on graphs of pathwidth 1