( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Rigorous DC Solution of Partial Element Equivalent Circuit Models.

, , , , , и . IEEE Trans. Circuits Syst. I Regul. Pap., 63-I (9): 1499-1510 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Daniele Silvestro

Daniele Soroldoni

Daniele Palmisano

Daniele Pillitteri

Daniele Suzzi

 

Другие публикации лиц с тем же именем

Hybrid Formulation of the Equation Systems of the 3-D PEEC Model Based on Graph Algorithms., , и . IEEE Trans. Circuits Syst. I Regul. Pap., 57-I (1): 249-261 (2010)Dynamic Multi-level Overlay Graphs for Shortest Paths., , , , и . Math. Comput. Sci., 1 (4): 709-736 (2008)Counting Edges in a Dag., , , и . WG, том 1197 из Lecture Notes in Computer Science, стр. 85-100. Springer, (1996)Dynamically Switching Vertices in Planar Graphs (Extended Abstract)., и . ESA, том 1284 из Lecture Notes in Computer Science, стр. 186-199. Springer, (1997)A Fully Dynamic Algorithm for Distributed Shortest Paths., , , и . LATIN, том 1776 из Lecture Notes in Computer Science, стр. 247-257. Springer, (2000)Multiple zooming in geographic maps., и . Data Knowl. Eng., 47 (2): 207-236 (2003)Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases., , , , и . J. Comb. Optim., 18 (3): 229-257 (2009)Supporting a Focus+Context Interaction Style for Spatial Databases., , и . WISE, стр. 328-335. IEEE Computer Society, (2000)Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study., и . ICCSA (2), том 11620 из Lecture Notes in Computer Science, стр. 72-81. Springer, (2019)Dynamically Maintaining Shortest Path Trees under Batches of Updates., , , , и . SIROCCO, том 8179 из Lecture Notes in Computer Science, стр. 286-297. Springer, (2013)