( en | de | ru )

 

Disambiguation of "Tomescu, Alexandru I."

Author of the publication

copydeleteadd this publication to your clipboard
Optimizing Safe Flow Decompositions in DAGs.

, and . ESA, volume 244 of LIPIcs, page 72:1-72:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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. You can also use the button next to the name to display some publications already assigned to the person.

Dr. phil.  Alexander I. Suciu

Reduced resonance schemes and Chen ranks, , , and . Journal für die Reine und Angewandte Mathematik (Crelle's Journal), (July 2024)

Alexandru Lupa

Alexandru Aleman

Alexandru Sarafiant

Alexandru Soceanu

 

Other publications of authors with the same name

On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy., , , , and . BIOINFORMATICS, page 272-277. SciTePress, (2016)MetaFlow: Metagenomic Profiling Based on Whole-Genome Coverage Analysis with Min-Cost Flows., , and . RECOMB, volume 9649 of Lecture Notes in Computer Science, page 111-121. Springer, (2016)Algorithms and Complexity on Indexing Elastic Founder Graphs., , , , , and . ISAAC, volume 212 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding., , and . CPM, volume 128 of LIPIcs, page 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Markov chain algorithms for generating sets uniformly at random., and . Ars Math. Contemp., 6 (1): 57-68 (2013)Faster FPTASes for Counting and Random Generation of Knapsack Solutions., and . ESA, volume 8737 of Lecture Notes in Computer Science, page 762-773. Springer, (2014)A Proof-checking Experiment on Representing Graphs as Membership Digraphs., , and . CILC, volume 1068 of CEUR Workshop Proceedings, page 227-233. CEUR-WS.org, (2013)Width Helps and Hinders Splitting Flows., , , , , , , and . ESA, volume 244 of LIPIcs, page 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Optimizing Safe Flow Decompositions in DAGs., and . ESA, volume 244 of LIPIcs, page 72:1-72:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Linear-Time Parameterized Algorithm for Computing the Width of a DAG., , , , and . WG, volume 12911 of Lecture Notes in Computer Science, page 257-269. Springer, (2021)