default search action

combined dblp search
author search
venue search
publication search

ask others

Sergey Gubin

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2020 – today

see FAQ

What is the meaning of the colors in the publication lists?

2020
[j1]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/sensors/KuznetsovaSAGSF20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sensors/KuznetsovaSAGSF20
Iren Kuznetsova, Andrey Smirnov, Vladimir Anisimkin, Sergey Gubin, Maria Assunta Signore, Luca Francioso, Jun Kondoh, Vladimir Kolesov:
Inkjet Printing of Plate Acoustic Wave Devices. Sensors 20(12): 3349 (2020)

2000 – 2009

see FAQ

What is the meaning of the colors in the publication lists?

2008
[i9]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-0802-2612
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0802-2612
Sergey Gubin:
On Subgraph Isomorphism. CoRR abs/0802.2612 (2008)
2007
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-0704-0108
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0704-0108
Sergey Gubin:
Reducing SAT to 2-SAT. CoRR abs/0704.0108 (2007)
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-0709-0974
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0709-0974
Sergey Gubin:
Finding Paths and Cycles in Graphs. CoRR abs/0709.0974 (2007)
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-0709-4273
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0709-4273
Sergey Gubin:
Set Matrices and The Path/Cycle Problem. CoRR abs/0709.4273 (2007)
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-0711-0086
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0711-0086
Sergey Gubin:
Convex and linear models of NP-problems. CoRR abs/0711.0086 (2007)
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-cs-0701023
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-cs-0701023
Sergey Gubin:
A Polynomial Time Algorithm for 3-SAT. CoRR abs/cs/0701023 (2007)
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-cs-0703098
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-cs-0703098
Sergey Gubin:
Polynomial time algorithm for 3-SAT. Examples of use. CoRR abs/cs/0703098 (2007)
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-cs-0703146
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-cs-0703146
Sergey Gubin:
A Polynomial Time Algorithm for SAT. CoRR abs/cs/0703146 (2007)
2006
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-cs-0610042
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-cs-0610042
Sergey Gubin:
A Polynomial Time Algorithm for The Traveling Salesman Problem. CoRR abs/cs/0610042 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.