Discover open access scientific publications

Search, annotate, share and cite publications

Publications by Sergej Jur'evich Andreev

The Algorithm of Finding of K Maximum Flows

SPIIRAS Proceedings
ControlSystems EngineeringInformation SystemsComputer NetworksApplied MathematicsMathematicsCommunicationsComputer Science ApplicationsComputational TheoryComputational MathematicsArtificial Intelligence
2014English

Related publications

Exact Combinatorial Algorithms and Experiments for Finding Maximum K-Plexes

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2011English

Fast Algorithm for Finding Maximum Distance With Space Subdivision in E2

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

2-Approximation Algorithm for Finding a Spanning Tree With Maximum Number of Leaves

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

A Simple Algorithm for Finding All K-Edge-Connected Components

PLoS ONE
Multidisciplinary
2015English

A Branch-And-Cut Algorithm for the Maximum K-Balanced Subgraph of a Signed Graph

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Algorithms for Finding the Weight-Constrained K Longest Paths in a Tree and the Length-Constrained K Maximum-Sum Segments of a Sequence

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2008English

Dose Titration Algorithm Tuning (DTAT) Should Supersede ‘The’ Maximum Tolerated Dose (MTD) in Oncology Dose-Finding Trials

F1000Research
GeneticsMolecular BiologyPharmacologyBiochemistryMicrobiology ImmunologyMedicineToxicologyPharmaceutics
2017English

Dose Titration Algorithm Tuning (DTAT) Should Supersede ‘The’ Maximum Tolerated Dose (MTD) in Oncology Dose-Finding Trials

F1000Research
GeneticsMolecular BiologyPharmacologyBiochemistryMicrobiology ImmunologyMedicineToxicologyPharmaceutics
2017English

Finding the K Smallest Spanning Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy