Publikationen am Institut für Mathematik

Anzahl der Treffer: 2083
Erstellt: Sun, 19 May 2024 17:07:23 +0200 in 0.0971 sec


French, Mark; Ilchmann, Achim; Ryan, Eugene P.
Robustness in the graph topology of a common adaptive controller. - In: SIAM journal on control and optimization, ISSN 1095-7138, Bd. 45 (2006), 5, S. 1736-1757

http://dx.doi.org/10.1137/0506336371
Mandaloju, Nagendra P.; Trenn, Stephan
Analogue implementation of the funnel controller. - In: Proceedings in applied mathematics and mechanics, ISSN 1617-7061, Bd. 6 (2006), 1, S. 823-824

http://dx.doi.org/10.1002/pamm.200610391
Rautenbach, Dieter; Schiermeyer, Ingo
Extremal problems for imbalanced edges. - In: Graphs and combinatorics, ISSN 1435-5914, Bd. 22 (2006), 1, S. 103-111

http://dx.doi.org/10.1007/s00373-005-0643-y
Favaron, Odile; Laskar, Renu; Rautenbach, Dieter
t-partitions and s-complete t-partitions of a graph. - In: The Australasian journal of combinatorics, ISSN 1034-4942, Bd. 36 (2006), S. 295-302

Ilchmann, Achim; Sawodny, Oliver; Trenn, Stephan
Pneumatic cylinders: modelling and feedback force-control. - In: International journal of control, ISSN 1366-5820, Bd. 79 (2006), 6, S. 650-661

http://dx.doi.org/10.1080/00207170600645875
Ilchmann, Achim; Ryan, Eugene P.
Asymptotic tracking with prescribed transient behaviour for linear systems. - In: International journal of control, ISSN 1366-5820, Bd. 79 (2006), 8, S. 910-917

http://dx.doi.org/10.1080/00207170600708699
Dobrynin, A. A.; Melnikov, L. S.; Walther, Hansjoachim; Schreyer, Jens
Čislo kosych poli&ptbov;edralьnych grafov s malym čislom veršin. - In: Problemy intellektualizacii i kačestva sistem informatiki, (2006), S. 34-41

The paper considers polyhedral graphs (graphs of polyhedron or planar 3-connected graphs). A face $\alpha$ of size $k$ of a polyhedral graph is of type $<a_1,a_2,...,a_k>$ if the vertices incident with $\alpha$ in cyclic order have degrees $a_1,a_2,...,a_k$ and this sequence is lexicographically minimal. A polyhedral graph is oblique if it has no two faces of the same type. The number of polyhedral graphs with up to 12 vertices is found. Some additional properties of such graphs are also considered.



Rautenbach, Dieter; Brandstädt, Andreas; Le, Van Bang
Distance-hereditary 5-leaf powers. - In: Electronic notes in discrete mathematics, ISSN 1571-0653, Bd. 27 (2006), S. 85-86

http://dx.doi.org/10.1016/j.endm.2006.08.068
Rautenbach, Dieter; Szegedy, Christian; Werber, Jürgen
Delay optimization of linear depth boolean circuits with prescribed input arrival times. - In: Journal of discrete algorithms, Bd. 4 (2006), 4, S. 526-537

http://dx.doi.org/10.1016/j.jda.2005.06.006
Voigt, Margit;
List colourings of planar graphs. - In: Discrete mathematics, Bd. 306 (2006), 10/11, S. 1076-1079

http://dx.doi.org/10.1016/j.disc.2006.03.027