( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Testing Isomorphism of Outerplanar Graphs in Parallel.

, , и . MFCS, том 324 из Lecture Notes in Computer Science, стр. 220-230. Springer, (1988)

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.

Tomasz Kupka

Ascheablagerungsprobleme bei der Mitverbrennung von alternativen Brennstoffen in Steinkohlekraftwerken. TU Clausthal-Zellerfeld, (2009)

Tomasz Wocjan

Dynamics of DNA in nucleosomes and plasmids studied by Brownian dynamics. Uni Heidelberg, (2009)

Dorothea Radzik-Bolt

Tomasz Mistrzyk

Tomasz Trela

 

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

Heuristic Enhancements to the k-best Method for Solving Biobjective Combinatorial Optimisation Problems., и . OR, стр. 373-378. (2005)Brief Announcement: Discrete Incremental Voting., , и . PODC, стр. 278-281. ACM, (2023)Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements., , , , , , и . CIAC, том 11485 из Lecture Notes in Computer Science, стр. 174-186. Springer, (2019)Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020., , и . Algorithmica, 84 (10): 3103-3106 (2022)Newton's Method for Fractional Combinatorial Optimization. FOCS, стр. 659-669. IEEE Computer Society, (1992)Faster Algorithms for the Generalized Network Flow Problem.. Math. Oper. Res., 23 (1): 69-100 (1998)New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs., , и . ACM Trans. Parallel Comput., 6 (3): 16:1-16:24 (2019)New bounds for single-machine time-dependent scheduling with uniform deterioration., , , и . Theor. Comput. Sci., (2024)Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs., , и . SPAA, стр. 305-312. ACM, (2017)Time-space trade-offs in population protocols for the majority problem., , , , , и . Distributed Comput., 34 (2): 91-111 (2021)